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 16:52Victor MerckléVictor MerckléScore: 4,092Success
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 16:544,06742,974,87232,654,0001,110,0002,117,632stderr
2Aug 10, 2026 16:544,07642,133,61932,721,0001,117,0002,117,632stderr
3Aug 10, 2026 16:544,08842,287,50032,851,0001,087,0002,117,632stderr
4Aug 10, 2026 16:544,09242,297,46732,859,0001,111,0002,117,632stderr
5Aug 10, 2026 16:544,09242,359,89432,864,0001,103,0002,117,632stderr
6Aug 10, 2026 16:544,09742,423,24632,979,0001,027,0002,117,632stderr
7Aug 10, 2026 16:544,09942,321,81532,904,0001,119,0002,117,632stderr
8Aug 10, 2026 16:544,11042,525,70533,008,0001,111,0002,117,632stderr
9Aug 10, 2026 16:544,13042,697,24333,169,0001,110,0002,117,632stderr