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 18:22Josu San MartinJosu San MartinScore: 83,611Success
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 18:2382,319692,863,715681,029,0002,219,0002,113,536
2Jul 3, 2026 18:2382,647695,578,655683,849,0002,127,0002,113,536
3Jul 3, 2026 18:2382,707696,100,076684,306,0002,170,0002,113,536
4Jul 3, 2026 18:2383,223701,564,261688,556,0002,203,0002,113,536
5Jul 3, 2026 18:2383,611703,644,470691,727,0002,247,0002,113,536
6Jul 3, 2026 18:2383,630703,798,517691,877,0002,260,0002,113,536
7Jul 3, 2026 18:2383,664704,535,585692,172,0002,246,0002,113,536
8Jul 3, 2026 18:2383,727704,911,067692,899,0002,038,0002,113,536
9Jul 3, 2026 18:2384,321709,906,391697,595,0002,272,0002,113,536