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 listMay 24, 2026 20:08Maya RebholzMaya RebholzScore: 7,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:097,18370,238,35453,993,0005,633,0002,113,536
2May 24, 2026 20:097,21269,235,86854,477,0005,387,0002,117,632
3May 24, 2026 20:097,22369,446,25354,545,0005,411,0002,113,536
4May 24, 2026 20:097,27270,592,00754,761,0005,604,0002,117,632
5May 24, 2026 20:097,27769,948,99655,063,0005,344,0002,113,536
6May 24, 2026 20:097,27969,808,85554,885,0005,535,0002,113,536
7May 24, 2026 20:097,28969,901,86155,241,0005,262,0002,117,632
8May 24, 2026 20:097,35172,382,76555,396,0005,624,0002,117,632
9May 24, 2026 20:097,51173,074,37056,802,0005,544,0002,113,536