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 05:29Victor MerckléVictor MerckléScore: 4,160Success
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 05:314,13842,284,60533,251,0001,101,0002,117,632stderr
2Jul 2, 2026 05:314,13842,332,23233,251,0001,100,0002,117,632stderr
3Jul 2, 2026 05:314,15642,457,07833,456,0001,043,0002,117,632stderr
4Jul 2, 2026 05:314,15942,537,85433,412,0001,108,0002,117,632stderr
5Jul 2, 2026 05:314,16042,454,27833,410,0001,121,0002,117,632stderr
6Jul 2, 2026 05:314,16042,513,37033,417,0001,113,0002,117,632stderr
7Jul 2, 2026 05:314,16942,537,16533,563,0001,046,0002,117,632stderr
8Jul 2, 2026 05:314,17442,613,96733,641,0001,006,0002,117,632stderr
9Jul 2, 2026 05:314,17742,648,57033,637,0001,038,0002,117,632stderr