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 09:24Kevin HeaveyKevin HeaveyScore: 3,547Success
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 09:263,51039,388,45928,098,0001,040,0002,113,536
2Sep 6, 2026 09:263,52737,669,64228,088,0001,192,0002,113,536
3Sep 6, 2026 09:263,53639,889,59028,281,0001,069,0002,113,536
4Sep 6, 2026 09:263,54039,147,21728,342,0001,043,0002,113,536
5Sep 6, 2026 09:263,54739,608,54528,406,0001,037,0002,113,536
6Sep 6, 2026 09:263,66540,335,46329,356,0001,070,0002,113,536
7Sep 6, 2026 09:263,68241,912,14229,513,0001,048,0002,113,536
8Sep 6, 2026 09:263,74641,213,04930,013,0001,079,0002,113,536
9Sep 6, 2026 09:263,83242,831,88230,778,0001,033,0002,113,536