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 20, 2026 06:07M-RochatM-RochatScore: 11,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0711,781110,098,37695,444,0002,343,0002,113,536
2May 20, 2026 06:0711,805109,506,39995,646,0002,338,0002,113,536
3May 20, 2026 06:0711,808108,216,17395,681,0002,326,0002,113,536
4May 20, 2026 06:0711,809110,906,01696,010,0002,011,0002,113,536
5May 20, 2026 06:0711,815110,186,21196,060,0002,010,0002,113,536
6May 20, 2026 06:0711,880110,504,04096,537,0002,075,0002,113,536
7May 20, 2026 06:0711,888111,873,90096,665,0002,013,0002,113,536
8May 20, 2026 06:0711,901112,050,75796,692,0002,092,0002,113,536
9May 20, 2026 06:0711,910111,550,34996,789,0002,070,0002,113,536