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 6, 2026 10:43Kevin HeaveyKevin HeaveyScore: 3,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:443,52937,836,24228,258,0001,034,0002,113,536
2Sep 6, 2026 10:443,55038,089,41628,392,0001,074,0002,113,536
3Sep 6, 2026 10:443,55938,240,47828,471,0001,071,0002,113,536
4Sep 6, 2026 10:443,59138,301,48928,764,0001,048,0002,113,536
5Sep 6, 2026 10:443,61338,420,27928,935,0001,060,0002,113,536
6Sep 6, 2026 10:443,61738,554,58828,985,0001,037,0002,113,536
7Sep 6, 2026 10:443,71039,338,84629,757,0001,040,0002,113,536
8Sep 6, 2026 10:443,75339,677,45830,119,0001,033,0002,113,536
9Sep 6, 2026 10:443,87440,746,07931,106,0001,052,0002,113,536