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 listMay 16, 2026 04:34Victor MerckléVictor MerckléScore: 7,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 04:347,03765,743,23957,297,0001,116,0002,113,536
2May 16, 2026 04:347,03867,885,37157,323,0001,100,0002,113,536
3May 16, 2026 04:347,04065,782,77557,343,0001,092,0002,113,536
4May 16, 2026 04:347,05767,557,30357,481,0001,099,0002,113,536
5May 16, 2026 04:347,06468,655,16457,551,0001,086,0002,113,536
6May 16, 2026 04:347,06867,905,56957,599,0001,067,0002,113,536
7May 16, 2026 04:347,08667,484,50057,736,0001,086,0002,113,536
8May 16, 2026 04:347,09266,235,75657,788,0001,082,0002,113,536
9May 16, 2026 04:347,11766,537,10957,967,0001,111,0002,113,536