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 13, 2026 02:50Victor MerckléVictor MerckléScore: 9,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 02:519,32486,477,22976,393,0001,004,0002,113,536
2May 13, 2026 02:519,32785,650,11976,373,0001,042,0002,113,536
3May 13, 2026 02:519,32887,612,40376,418,0001,008,0002,113,536
4May 13, 2026 02:519,33086,262,26676,420,0001,026,0002,113,536
5May 13, 2026 02:519,33186,881,54076,404,0001,047,0002,113,536
6May 13, 2026 02:519,33385,321,65876,460,0001,009,0002,113,536
7May 13, 2026 02:519,33384,788,04976,464,0001,002,0002,113,536
8May 13, 2026 02:519,33985,626,66276,454,0001,064,0002,113,536
9May 13, 2026 02:519,35484,905,26276,643,0001,003,0002,113,536