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:26Kevin HeaveyKevin HeaveyScore: 3,850Success
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:273,67640,498,17129,358,0001,153,0002,113,536
2Sep 6, 2026 09:273,78741,390,77130,256,0001,179,0002,113,536
3Sep 6, 2026 09:273,81941,760,59130,547,0001,152,0002,113,536
4Sep 6, 2026 09:273,83842,706,71830,710,0001,146,0002,113,536
5Sep 6, 2026 09:273,85041,979,97730,817,0001,143,0002,113,536
6Sep 6, 2026 09:273,85342,018,16030,803,0001,180,0002,113,536
7Sep 6, 2026 09:273,86242,838,95530,916,0001,145,0002,113,536
8Sep 6, 2026 09:273,87242,210,23730,993,0001,152,0002,113,536
9Sep 6, 2026 09:273,90843,278,51831,258,0001,179,0002,113,536