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 18, 2026 13:08boop34boop34Score: 9,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:099,07984,935,78274,162,0001,195,0002,113,536
2Jul 18, 2026 13:099,09085,121,97874,222,0001,225,0002,113,536
3Jul 18, 2026 13:099,09285,097,90574,284,0001,187,0002,113,536
4Jul 18, 2026 13:099,12085,377,79774,574,0001,126,0002,113,536
5Jul 18, 2026 13:099,14185,471,68074,650,0001,225,0002,113,536
6Jul 18, 2026 13:099,15086,864,17274,822,0001,129,0002,113,536
7Jul 18, 2026 13:099,17585,818,39175,044,0001,116,0002,113,536
8Jul 18, 2026 13:099,24787,051,56075,526,0001,226,0002,113,536
9Jul 18, 2026 13:099,37687,505,17676,716,0001,111,0002,113,536