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 08:52Victor MerckléVictor MerckléScore: 4,170Success
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 08:534,14542,239,52033,275,0001,135,0002,117,632stderr
2Jul 2, 2026 08:534,14742,153,57233,402,0001,020,0002,117,632stderr
3Jul 2, 2026 08:534,14942,188,15833,351,0001,091,0002,117,632stderr
4Jul 2, 2026 08:534,16242,375,47333,445,0001,104,0002,117,632stderr
5Jul 2, 2026 08:534,17042,490,90933,599,0001,015,0002,117,632stderr
6Jul 2, 2026 08:534,26643,169,96234,314,0001,099,0002,117,632stderr
7Jul 2, 2026 08:534,28343,457,53334,527,0001,027,0002,117,632stderr
8Jul 2, 2026 08:534,28443,288,51534,533,0001,025,0002,117,632stderr
9Jul 2, 2026 08:534,37644,174,48635,231,0001,098,0002,117,632stderr