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 26, 2026 01:45Victor MerckléVictor MerckléScore: 3,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 01:463,82040,104,28830,557,0001,154,0002,117,632stderr
2Aug 26, 2026 01:463,83340,008,34330,714,0001,103,0002,117,632stderr
3Aug 26, 2026 01:463,84140,237,79330,755,0001,133,0002,117,632stderr
4Aug 26, 2026 01:463,85040,332,03930,847,0001,109,0002,117,632stderr
5Aug 26, 2026 01:463,85840,437,26130,828,0001,197,0002,117,632stderr
6Aug 26, 2026 01:463,85840,465,33030,871,0001,158,0002,117,632stderr
7Aug 26, 2026 01:463,87240,486,70231,070,0001,074,0002,117,632stderr
8Aug 26, 2026 01:463,89940,767,46631,223,0001,142,0002,117,632stderr
9Aug 26, 2026 01:463,90240,770,32331,241,0001,150,0002,117,632stderr