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 27, 2026 14:20Victor MerckléVictor MerckléScore: 3,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 14:213,80939,979,28730,476,0001,145,0002,117,632stderr
2Aug 27, 2026 14:213,81239,976,53530,504,0001,136,0002,117,632stderr
3Aug 27, 2026 14:213,81339,776,52230,467,0001,186,0002,117,632stderr
4Aug 27, 2026 14:213,82240,125,23130,648,0001,077,0002,117,632stderr
5Aug 27, 2026 14:213,82939,887,70230,467,0001,314,0002,117,632stderr
6Aug 27, 2026 14:213,83040,872,79030,633,0001,161,0002,117,632stderr
7Aug 27, 2026 14:213,85040,152,58530,805,0001,152,0002,117,632stderr
8Aug 27, 2026 14:213,89240,520,16631,131,0001,180,0002,117,632stderr
9Aug 27, 2026 14:213,92941,079,83231,497,0001,119,0002,117,632stderr