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 listSep 12, 2026 15:56Kevin HeaveyKevin HeaveyScore: 3,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:573,69240,877,61029,596,0001,053,0002,117,632
2Sep 12, 2026 15:573,72641,120,25629,874,0001,052,0002,117,632
3Sep 12, 2026 15:573,81941,934,49230,662,0001,039,0002,117,632
4Sep 12, 2026 15:573,85342,230,82730,945,0001,039,0002,117,632
5Sep 12, 2026 15:573,86242,255,87230,823,0001,237,0002,117,632
6Sep 12, 2026 15:573,88342,429,84131,030,0001,202,0002,117,632
7Sep 12, 2026 15:573,92342,845,74731,524,0001,045,0002,117,632
8Sep 12, 2026 15:573,95243,108,69531,587,0001,219,0002,117,632
9Sep 12, 2026 15:573,95343,065,81531,592,0001,220,0002,117,632