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 14, 2026 15:38Kevin HeaveyKevin HeaveyScore: 3,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 15:393,56138,303,44728,357,0001,202,0002,113,536
2Sep 14, 2026 15:393,56238,256,45528,383,0001,186,0002,113,536
3Sep 14, 2026 15:393,56738,498,92728,569,0001,045,0002,113,536
4Sep 14, 2026 15:393,56938,387,97728,430,0001,193,0002,113,536
5Sep 14, 2026 15:393,58638,545,63128,700,0001,072,0002,113,536
6Sep 14, 2026 15:393,68840,090,43529,581,0001,033,0002,113,536
7Sep 14, 2026 15:393,75639,917,34429,968,0001,211,0002,113,536
8Sep 14, 2026 15:393,76840,827,79330,070,0001,210,0002,113,536
9Sep 14, 2026 15:393,81441,162,99430,482,0001,181,0002,113,536