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 30, 2026 21:53Josu San MartinJosu San MartinScore: 4,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:534,23343,583,18934,114,0001,028,0002,113,536
2Aug 30, 2026 21:534,28944,156,10334,453,0001,153,0002,113,536
3Aug 30, 2026 21:534,29053,333,00534,500,0001,115,0002,113,536
4Aug 30, 2026 21:534,29844,239,83534,624,0001,052,0002,113,536
5Aug 30, 2026 21:534,30044,159,77234,659,0001,039,0002,113,536
6Aug 30, 2026 21:534,32044,350,52234,807,0001,050,0002,113,536
7Aug 30, 2026 21:534,33944,480,48434,973,0001,044,0002,113,536
8Aug 30, 2026 21:534,35044,607,69435,081,0001,032,0002,113,536
9Aug 30, 2026 21:534,38344,817,77435,351,0001,036,0002,113,536