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:33Josu San MartinJosu San MartinScore: 6,080Success
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:336,01359,319,13046,672,0003,239,0002,113,536
2Jul 4, 2026 00:336,02559,311,06946,721,0003,290,0002,113,536
3Jul 4, 2026 00:336,04659,590,24047,134,0003,049,0002,113,536
4Jul 4, 2026 00:336,04759,592,30446,909,0003,286,0002,113,536
5Jul 4, 2026 00:336,08061,213,75447,275,0003,189,0002,113,536
6Jul 4, 2026 00:336,08559,840,73747,298,0003,210,0002,113,536
7Jul 4, 2026 00:336,09059,944,59647,504,0003,049,0002,113,536
8Jul 4, 2026 00:336,23961,229,50248,517,0003,274,0002,113,536
9Jul 4, 2026 00:337,11668,508,68255,884,0003,186,0002,113,536