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 23, 2026 12:03Kevin HeaveyKevin HeaveyScore: 3,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 12:043,19735,528,62625,520,0001,017,00020,480
2Sep 23, 2026 12:043,21235,658,66325,589,0001,073,00020,480
3Sep 23, 2026 12:043,21635,708,61525,677,0001,024,00020,480
4Sep 23, 2026 12:043,22235,719,82825,705,0001,044,00020,480
5Sep 23, 2026 12:043,22435,767,21725,711,0001,055,00020,480
6Sep 23, 2026 12:043,23636,083,83725,811,0001,055,00020,480
7Sep 23, 2026 12:043,23935,801,92025,804,0001,081,00020,480
8Sep 23, 2026 12:043,24135,899,50725,862,0001,039,00020,480
9Sep 23, 2026 12:043,25235,912,87925,949,0001,050,00020,480