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 2, 2026 12:52Victor MerckléVictor MerckléScore: 4,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:534,14242,138,58433,375,0001,005,0002,117,632stderr
2Jul 2, 2026 12:534,15042,306,60833,332,0001,115,0002,117,632stderr
3Jul 2, 2026 12:534,15442,267,58633,375,0001,104,0002,117,632stderr
4Jul 2, 2026 12:534,17242,469,02933,596,0001,037,0002,117,632stderr
5Jul 2, 2026 12:534,17542,566,73833,552,0001,105,0002,117,632stderr
6Jul 2, 2026 12:534,17642,526,69933,626,0001,035,0002,117,632stderr
7Jul 2, 2026 12:534,17942,430,22633,641,0001,045,0002,117,632stderr
8Jul 2, 2026 12:534,21142,658,38733,846,0001,111,0002,117,632stderr
9Jul 2, 2026 12:534,22542,917,14634,038,0001,032,0002,117,632stderr