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 17, 2026 13:28Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:366,94767,052,87256,624,0001,037,0002,113,536
2May 17, 2026 13:366,95366,136,61256,675,0001,040,0002,113,536
3May 17, 2026 13:366,95465,687,39656,707,0001,012,0002,113,536
4May 17, 2026 13:366,95965,958,10456,750,0001,012,0002,113,536
5May 17, 2026 13:366,96765,225,15956,710,0001,123,0002,113,536
6May 17, 2026 13:366,97767,653,10956,853,0001,064,0002,113,536
7May 17, 2026 13:367,01967,072,50157,233,0001,025,0002,113,536
8May 17, 2026 13:367,07766,134,20357,696,0001,044,0002,113,536
9May 17, 2026 13:367,11668,327,47658,018,0001,046,0002,113,536