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 listMay 10, 2026 15:47Josu San MartinJosu San MartinScore: 3,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 15:473,96940,292,04531,883,0001,066,0002,113,536
2May 10, 2026 15:473,97742,244,54731,946,0001,064,0002,113,536
3May 10, 2026 15:473,98142,176,57431,998,0001,052,0002,113,536
4May 10, 2026 15:473,99342,255,31532,075,0001,072,0002,113,536
5May 10, 2026 15:473,99542,971,56332,113,0001,046,0002,113,536
6May 10, 2026 15:474,00344,187,51432,174,0001,057,0002,113,536
7May 10, 2026 15:474,00341,243,17732,172,0001,059,0002,113,536
8May 10, 2026 15:474,00643,951,37232,185,0001,066,0002,113,536
9May 10, 2026 15:474,00843,460,68832,125,0001,149,0002,113,536