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 12:49Victor MerckléVictor MerckléScore: 4,573Success
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 12:504,55447,504,60936,721,0001,079,0002,113,536
2May 24, 2026 12:504,55748,815,04936,749,0001,077,0002,113,536
3May 24, 2026 12:504,56045,643,54536,794,0001,056,0002,113,536
4May 24, 2026 12:504,57147,577,55036,939,0001,007,0002,113,536
5May 24, 2026 12:504,57346,954,73436,958,0001,005,0002,113,536
6May 24, 2026 12:504,58146,985,21236,996,0001,029,0002,113,536
7May 24, 2026 12:504,58948,002,03937,014,0001,080,0002,113,536
8May 24, 2026 12:504,59747,891,64037,152,0001,005,0002,113,536
9May 24, 2026 12:504,60246,872,58437,174,0001,028,0002,113,536