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 9, 2026 19:46Victor MerckléVictor MerckléScore: 157,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 19:48157,1171,312,211,5661,302,943,0001,133,0002,117,632stderr
2Jul 9, 2026 19:48157,1631,312,634,8761,303,454,0001,000,0002,117,632stderr
3Jul 9, 2026 19:48157,1721,312,743,3151,303,513,0001,020,0002,117,632stderr
4Jul 9, 2026 19:48157,1721,312,694,8771,303,527,0001,006,0002,117,632stderr
5Jul 9, 2026 19:48157,1821,315,163,1071,303,603,0001,012,0002,117,632stderr
6Jul 9, 2026 19:48157,1971,312,949,4511,303,643,0001,099,0002,117,632stderr
7Jul 9, 2026 19:48157,2031,312,940,0641,303,670,0001,116,0002,117,632stderr
8Jul 9, 2026 19:48157,2441,313,328,9861,304,018,0001,112,0002,117,632stderr
9Jul 9, 2026 19:48157,2491,313,389,0321,304,031,0001,138,0002,117,632stderr