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 listAug 26, 2026 00:47Victor MerckléVictor MerckléScore: 9,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 00:489,27285,241,46675,845,0001,118,0002,117,632stderr
2Aug 26, 2026 00:489,30385,473,26076,198,0001,017,0002,117,632stderr
3Aug 26, 2026 00:489,31785,718,30276,246,0001,091,0002,117,632stderr
4Aug 26, 2026 00:489,31985,561,01276,306,0001,042,0002,117,632stderr
5Aug 26, 2026 00:489,33685,819,98976,469,0001,023,0002,117,632stderr
6Aug 26, 2026 00:489,34985,858,48776,575,0001,027,0002,117,632stderr
7Aug 26, 2026 00:489,38086,135,62876,729,0001,128,0002,117,632stderr
8Aug 26, 2026 00:489,38486,068,05376,820,0001,073,0002,117,632stderr
9Aug 26, 2026 00:489,46986,831,07677,558,0001,038,0002,117,632stderr