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 24, 2026 16:01Victor MerckléVictor MerckléScore: 7,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 16:017,04368,932,38557,412,0001,051,0002,113,536
2May 24, 2026 16:017,04369,118,76457,397,0001,064,0002,113,536
3May 24, 2026 16:017,04568,586,27657,417,0001,064,0002,113,536
4May 24, 2026 16:017,04967,104,98657,468,0001,040,0002,113,536
5May 24, 2026 16:017,05168,107,62857,483,0001,048,0002,113,536
6May 24, 2026 16:017,09868,452,45957,901,0001,013,0002,113,536
7May 24, 2026 16:017,09867,333,94857,873,0001,046,0002,113,536
8May 24, 2026 16:017,10069,661,42357,871,0001,060,0002,113,536
9May 24, 2026 16:017,10468,343,18157,883,0001,082,0002,113,536