Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 26, 2025 15:10Ruoyu QiuRuoyu QiuScore: 236,144Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2025 15:10235,7711,988,059,9391,783,998,000172,902,0002,297,856
2Jul 26, 2025 15:10236,0581,980,559,6451,764,355,000194,928,0002,301,952
3Jul 26, 2025 15:10236,1071,982,423,3791,761,820,000197,867,0002,347,008
4Jul 26, 2025 15:10236,1221,983,153,4531,783,920,000175,893,0002,371,584
5Jul 26, 2025 15:10236,1441,985,483,1711,771,090,000188,902,0002,428,928
6Jul 26, 2025 15:10236,1901,986,280,4381,765,441,000194,938,0002,506,752
7Jul 26, 2025 15:10250,1422,105,358,4431,894,252,000181,928,0002,408,448
8Jul 26, 2025 15:10258,9472,183,036,4381,959,413,000189,846,0002,502,656
9Jul 26, 2025 15:10259,0722,172,926,8331,949,363,000200,934,0002,314,240