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 22:30Josu San MartinJosu San MartinScore: 9,389Success
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 22:329,27886,347,01173,202,0003,812,0002,113,536
2Jul 3, 2026 22:329,33386,783,75573,659,0003,807,0002,113,536
3Jul 3, 2026 22:329,36087,014,94973,895,0003,793,0002,113,536
4Jul 3, 2026 22:329,38687,267,90274,078,0003,827,0002,113,536
5Jul 3, 2026 22:329,38987,371,18074,193,0003,742,0002,113,536
6Jul 3, 2026 22:329,50188,411,37975,059,0003,805,0002,113,536
7Jul 3, 2026 22:329,53088,493,06575,304,0003,801,0002,113,536
8Jul 3, 2026 22:329,56188,719,88475,624,0003,739,0002,113,536
9Jul 3, 2026 22:329,60789,080,71675,863,0003,877,0002,113,536