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 25, 2026 22:02Kevin HeaveyKevin HeaveyScore: 3,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 22:053,51839,131,24128,069,0001,135,0002,113,536
2Jul 25, 2026 22:053,54739,488,51828,277,0001,165,0002,113,536
3Jul 25, 2026 22:053,57039,627,77428,487,0001,145,0002,113,536
4Jul 25, 2026 22:053,59939,804,81028,717,0001,158,0002,113,536
5Jul 25, 2026 22:053,60339,916,08028,752,0001,155,0002,113,536
6Jul 25, 2026 22:053,61940,004,76728,904,0001,136,0002,113,536
7Jul 25, 2026 22:053,82941,747,58730,654,0001,127,0002,113,536
8Jul 25, 2026 22:053,84641,912,66430,778,0001,150,0002,113,536
9Jul 25, 2026 22:053,85441,938,36630,887,0001,104,0002,113,536