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 11:53Kevin HeaveyKevin HeaveyScore: 3,576Success
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 11:543,55039,326,20928,339,0001,129,0002,113,536
2Sep 6, 2026 11:543,55839,354,27228,441,0001,092,0002,113,536
3Sep 6, 2026 11:543,56139,456,81528,410,0001,154,0002,113,536
4Sep 6, 2026 11:543,56239,461,17528,450,0001,116,0002,113,536
5Sep 6, 2026 11:543,57639,602,78428,588,0001,101,0002,113,536
6Sep 6, 2026 11:543,57939,570,65728,612,0001,101,0002,113,536
7Sep 6, 2026 11:543,68440,502,07829,479,0001,106,0002,113,536
8Sep 6, 2026 11:543,82441,623,40530,632,0001,114,0002,113,536
9Sep 6, 2026 11:543,84341,764,79430,775,0001,122,0002,113,536