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 1, 2026 20:15TonyTonyScore: 57,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 20:1557,932490,858,763479,828,0001,009,0002,113,536
2Aug 1, 2026 20:1557,945490,935,161479,944,0001,001,0002,113,536
3Aug 1, 2026 20:1557,954491,071,952480,019,0001,003,0002,113,536
4Aug 1, 2026 20:1557,958491,045,918480,050,0001,005,0002,113,536
5Aug 1, 2026 20:1557,959490,987,822480,061,0001,002,0002,113,536
6Aug 1, 2026 20:1558,117492,307,235481,375,0001,004,0002,113,536
7Aug 1, 2026 20:1558,127493,676,835481,455,0001,001,0002,113,536
8Aug 1, 2026 20:1558,148492,611,891481,633,0001,001,0002,113,536
9Aug 1, 2026 20:1558,152492,648,708481,663,0001,001,0002,113,536