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 listAug 7, 2026 15:53TonyTonyScore: 6,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 15:536,38462,873,33150,434,0002,558,0002,113,536
2Aug 7, 2026 15:536,42263,092,34350,714,0002,596,0002,113,536
3Aug 7, 2026 15:536,43563,242,85150,940,0002,473,0002,113,536
4Aug 7, 2026 15:536,55064,208,68551,818,0002,553,0002,113,536
5Aug 7, 2026 15:536,55964,221,68151,824,0002,619,0002,113,536
6Aug 7, 2026 15:536,60264,677,14152,198,0002,604,0002,113,536
7Aug 7, 2026 15:536,62464,774,49552,436,0002,544,0002,113,536
8Aug 7, 2026 15:536,65865,105,17452,745,0002,524,0002,113,536
9Aug 7, 2026 15:536,75866,032,99553,485,0002,611,0002,113,536