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 20:08Josu San MartinJosu San MartinScore: 6,650Success
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 20:096,58964,069,57749,498,0005,193,0002,113,536
2Jul 3, 2026 20:096,60764,298,54049,541,0005,301,0002,113,536
3Jul 3, 2026 20:096,61664,285,84749,738,0005,180,0002,113,536
4Jul 3, 2026 20:096,62964,361,91549,824,0005,202,0002,113,536
5Jul 3, 2026 20:096,65064,592,91550,023,0005,177,0002,113,536
6Jul 3, 2026 20:096,65264,974,57749,933,0005,282,0002,113,536
7Jul 3, 2026 20:096,66564,661,50950,084,0005,241,0002,113,536
8Jul 3, 2026 20:096,66764,686,48450,117,0005,222,0002,113,536
9Jul 3, 2026 20:096,67665,201,62750,085,0005,331,0002,113,536