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 14, 2026 03:56Victor MerckléVictor MerckléScore: 7,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 03:567,06268,062,11658,620,00002,113,536
2May 14, 2026 03:567,06265,943,14058,615,00002,113,536
3May 14, 2026 03:567,06467,343,93058,638,00002,113,536
4May 14, 2026 03:567,06567,486,55557,632,0001,014,0002,113,536
5May 14, 2026 03:567,07068,874,35457,675,0001,006,0002,113,536
6May 14, 2026 03:567,07165,976,43657,688,0001,004,0002,113,536
7May 14, 2026 03:567,10367,666,88857,926,0001,034,0002,113,536
8May 14, 2026 03:567,13466,943,16558,161,0001,052,0002,113,536
9May 14, 2026 03:567,22468,132,49059,967,00002,113,536