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:01Victor MerckléVictor MerckléScore: 5,481Success
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:025,45153,304,41444,160,0001,084,0002,117,632stderr
2Jul 6, 2026 21:025,46353,401,98944,213,0001,137,0002,117,632stderr
3Jul 6, 2026 21:025,47353,926,59544,259,0001,168,0002,117,632stderr
4Jul 6, 2026 21:025,47553,588,78244,275,0001,169,0002,117,632stderr
5Jul 6, 2026 21:025,48154,000,85144,311,0001,186,0002,117,632stderr
6Jul 6, 2026 21:025,48254,687,22844,493,0001,015,0002,117,632stderr
7Jul 6, 2026 21:025,48854,123,23344,542,0001,012,0002,117,632stderr
8Jul 6, 2026 21:025,49354,090,98844,578,0001,018,0002,117,632stderr
9Jul 6, 2026 21:025,49354,135,01644,522,0001,072,0002,117,632stderr