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 02:07Adam LaRussoAdam LaRussoScore: 58,620Success
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 02:0758,604511,338,630485,410,0001,000,0002,281,472
2Feb 18, 2026 02:0758,608515,142,796484,442,0002,001,0002,281,472
3Feb 18, 2026 02:0758,609514,458,253483,462,0002,996,0002,281,472
4Feb 18, 2026 02:0758,620514,636,665485,549,000999,0002,293,760
5Feb 18, 2026 02:0758,620513,302,247483,546,0002,997,0002,371,584
6Feb 18, 2026 02:0758,624513,652,087483,584,0002,997,0002,293,760
7Feb 18, 2026 02:0758,626515,598,163485,598,000999,0002,527,232
8Feb 18, 2026 02:0758,629513,037,552484,626,0001,998,0002,281,472
9Feb 18, 2026 02:0758,640517,604,360483,715,0002,998,0002,281,472