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 6, 2026 21:53Victor MerckléVictor MerckléScore: 28,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:5428,350243,371,466234,207,0001,104,0002,117,632stderr
2Jul 6, 2026 21:5428,399243,831,783234,672,0001,041,0002,117,632stderr
3Jul 6, 2026 21:5428,407243,994,194234,690,0001,095,0002,117,632stderr
4Jul 6, 2026 21:5428,442244,149,134234,889,0001,183,0002,117,632stderr
5Jul 6, 2026 21:5428,480244,445,169235,270,0001,116,0002,117,632stderr
6Jul 6, 2026 21:5428,487244,621,422235,427,0001,022,0002,117,632stderr
7Jul 6, 2026 21:5429,583253,626,039235,706,0009,836,0002,117,632stderr
8Jul 6, 2026 21:5429,677254,578,748236,118,00010,206,00024,576stderr
9Jul 6, 2026 21:5429,767255,202,030238,410,0008,661,00024,576stderr