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 listFeb 18, 2026 11:48wnwnScore: 7,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 11:486,45282,105,52250,523,0003,031,0002,367,488
2Feb 18, 2026 11:486,48776,729,09647,856,0005,982,0002,469,888
3Feb 18, 2026 11:486,53875,362,88751,250,0003,014,0002,265,088
4Feb 18, 2026 11:487,39682,482,59857,359,0004,025,0002,514,944
5Feb 18, 2026 11:487,43888,344,83158,747,0002,987,0002,281,472
6Feb 18, 2026 11:487,46584,315,61057,963,0003,997,0002,387,968