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 24, 2026 18:26Victor MerckléVictor MerckléScore: 3,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:283,90541,478,43031,280,0001,133,0002,117,632stderr
2Aug 24, 2026 18:283,90540,812,10031,274,0001,138,0002,117,632stderr
3Aug 24, 2026 18:283,91440,858,60131,248,0001,245,0002,117,632stderr
4Aug 24, 2026 18:283,93441,005,94031,527,0001,133,0002,117,632stderr
5Aug 24, 2026 18:283,93641,726,09631,528,0001,141,0002,117,632stderr
6Aug 24, 2026 18:284,05342,576,77632,285,0001,356,0002,117,632stderr
7Aug 24, 2026 18:284,63351,892,92337,058,0001,403,0002,117,632stderr
8Aug 24, 2026 18:284,72352,503,29437,102,0002,104,0002,117,632stderr
9Aug 24, 2026 18:284,79153,195,08637,697,0002,072,0002,117,632stderr