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 listJul 9, 2026 12:33Victor MerckléVictor MerckléScore: 4,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 12:344,07441,902,93432,717,0001,099,0002,117,632stderr
2Jul 9, 2026 12:344,07641,909,28332,724,0001,113,0002,117,632stderr
3Jul 9, 2026 12:344,09142,117,51732,880,0001,078,0002,117,632stderr
4Jul 9, 2026 12:344,09342,049,68632,873,0001,106,0002,117,632stderr
5Jul 9, 2026 12:344,09642,178,93032,881,0001,119,0002,117,632stderr
6Jul 9, 2026 12:344,10242,141,09533,020,0001,029,0002,117,632stderr
7Jul 9, 2026 12:344,10442,192,25832,940,0001,131,0002,117,632stderr
8Jul 9, 2026 12:344,10842,247,61033,080,0001,024,0002,117,632stderr
9Jul 9, 2026 12:344,11942,283,28333,148,0001,041,0002,117,632stderr