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 4, 2026 00:54Josu San MartinJosu San MartinScore: 5,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:545,13151,980,47439,195,0003,399,0002,113,536
2Jul 4, 2026 00:545,21352,640,40339,827,0003,448,0002,113,536
3Jul 4, 2026 00:545,21652,653,04339,879,0003,414,0002,113,536
4Jul 4, 2026 00:545,22752,859,67039,972,0003,419,0002,113,536
5Jul 4, 2026 00:545,26553,000,19940,338,0003,363,0002,113,536
6Jul 4, 2026 00:545,30953,384,36940,551,0003,521,0002,113,536
7Jul 4, 2026 00:545,34453,808,07640,876,0003,486,0002,113,536
8Jul 4, 2026 00:545,35055,248,09640,901,0003,511,0002,113,536
9Jul 4, 2026 00:545,35753,837,80241,319,0003,146,0002,113,536