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 25, 2026 01:10Victor MerckléVictor MerckléScore: 4,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:114,00342,333,11032,087,0001,144,0002,117,632stderr
2Aug 25, 2026 01:114,01141,718,65732,187,0001,105,0002,117,632stderr
3Aug 25, 2026 01:114,01941,742,25532,203,0001,159,0002,117,632stderr
4Aug 25, 2026 01:114,02041,742,06732,268,0001,106,0002,117,632stderr
5Aug 25, 2026 01:114,04041,894,54132,479,0001,055,0002,117,632stderr
6Aug 25, 2026 01:114,04641,970,31932,534,0001,048,0002,117,632stderr
7Aug 25, 2026 01:114,04741,982,82032,483,0001,115,0002,117,632stderr
8Aug 25, 2026 01:114,05143,122,27332,565,0001,063,0002,117,632stderr
9Aug 25, 2026 01:114,05542,033,30132,536,0001,128,0002,117,632stderr