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 listJul 22, 2026 15:35Kevin HeaveyKevin HeaveyScore: 3,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 15:373,54239,153,28128,274,0001,129,0002,113,536
2Jul 22, 2026 15:373,57839,487,72428,588,0001,113,0002,113,536
3Jul 22, 2026 15:373,59239,544,48928,671,0001,146,0002,113,536
4Jul 22, 2026 15:373,60640,314,04928,773,0001,162,0002,113,536
5Jul 22, 2026 15:373,62340,062,76428,948,0001,128,0002,113,536
6Jul 22, 2026 15:373,64440,590,38629,097,0001,150,0002,113,536
7Jul 22, 2026 15:373,75847,068,09230,012,0001,187,0002,113,536
8Jul 22, 2026 15:373,83342,160,31530,653,0001,165,0002,113,536
9Jul 22, 2026 15:373,86042,449,05130,855,0001,186,0002,113,536