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 1, 2026 22:07Code HintsCode HintsScore: 6,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 22:126,15158,796,71549,024,0002,035,0002,113,536
2Jul 1, 2026 22:126,15558,825,92349,005,0002,082,0002,113,536
3Jul 1, 2026 22:126,20859,494,58049,460,0002,069,0002,113,536
4Jul 1, 2026 22:126,35460,672,42750,703,0002,040,0002,113,536
5Jul 1, 2026 22:126,38260,947,86550,900,0002,071,0002,113,536
6Jul 1, 2026 22:126,42361,114,39551,255,0002,060,0002,113,536
7Jul 1, 2026 22:126,44961,548,08850,521,0003,013,0002,113,536
8Jul 1, 2026 22:126,45761,385,51351,559,0002,040,0002,113,536
9Jul 1, 2026 22:126,45861,383,97850,557,0003,046,0002,113,536