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 listAug 11, 2026 16:37Victor MerckléVictor MerckléScore: 3,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:383,83740,242,34730,803,0001,046,0002,117,632stderr
2Aug 11, 2026 16:383,84240,352,59830,740,0001,150,0002,117,632stderr
3Aug 11, 2026 16:383,86440,490,47931,049,0001,028,0002,117,632stderr
4Aug 11, 2026 16:383,86740,534,53931,048,0001,054,0002,117,632stderr
5Aug 11, 2026 16:383,86940,533,63530,950,0001,170,0002,117,632stderr
6Aug 11, 2026 16:383,87740,672,89031,015,0001,168,0002,117,632stderr
7Aug 11, 2026 16:383,89240,665,27931,278,0001,027,0002,117,632stderr
8Aug 11, 2026 16:383,92741,058,87831,564,0001,035,0002,117,632stderr
9Aug 11, 2026 16:384,02541,802,52232,395,0001,015,0002,117,632stderr