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 3, 2026 16:46Josu San MartinJosu San MartinScore: 58,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 16:4858,153492,115,015481,669,0001,005,0002,113,536
2Jul 3, 2026 16:4858,170492,147,862481,813,0001,003,0002,113,536
3Jul 3, 2026 16:4858,175492,302,443481,850,0001,004,0002,113,536
4Jul 3, 2026 16:4858,175492,254,451481,853,0001,006,0002,113,536
5Jul 3, 2026 16:4858,178492,272,044481,873,0001,005,0002,113,536
6Jul 3, 2026 16:4858,180492,251,393481,895,0001,004,0002,113,536
7Jul 3, 2026 16:4858,185492,287,895481,938,0001,005,0002,113,536
8Jul 3, 2026 16:4858,197492,396,531482,033,0001,004,0002,113,536
9Jul 3, 2026 16:4858,199492,654,654482,050,0001,003,0002,113,536