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 19, 2026 11:07Victor MerckléVictor MerckléScore: 6,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 11:086,02157,739,05748,954,0001,028,0002,113,536
2May 19, 2026 11:086,02157,810,23548,960,0001,022,0002,113,536
3May 19, 2026 11:086,02957,828,14649,042,0001,004,0002,113,536
4May 19, 2026 11:086,08458,280,11749,463,0001,035,0002,113,536
5May 19, 2026 11:086,18859,142,42150,321,0001,044,0002,113,536
6May 19, 2026 11:086,20159,538,85850,471,0001,004,0002,113,536
7May 19, 2026 11:086,20959,329,65850,529,0001,006,0002,113,536
8May 19, 2026 11:086,20961,138,79150,511,0001,027,0002,113,536
9May 19, 2026 11:086,22259,454,12850,645,0001,004,0002,113,536