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 10, 2026 09:52Victor MerckléVictor MerckléScore: 6,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 09:525,94557,775,03748,334,0001,011,0002,117,632stderr
2Aug 10, 2026 09:525,97357,940,89548,567,0001,012,0002,117,632stderr
3Aug 10, 2026 09:526,06358,715,19149,306,0001,019,0002,117,632stderr
4Aug 10, 2026 09:526,07358,833,07149,400,0001,010,0002,117,632stderr
5Aug 10, 2026 09:526,07659,378,83349,417,0001,022,0002,117,632stderr
6Aug 10, 2026 09:526,09159,603,55249,529,0001,030,0002,117,632stderr
7Aug 10, 2026 09:526,09259,663,84449,539,0001,027,0002,117,632stderr
8Aug 10, 2026 09:526,10159,782,86749,600,0001,041,0002,117,632stderr
9Aug 10, 2026 09:526,10259,227,54549,618,0001,030,0002,117,632stderr