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 11, 2026 18:18olliecrowolliecrowScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:185,94080,072,80646,286,0003,018,0002,281,472
2Feb 11, 2026 18:186,13178,034,49945,898,0004,989,0002,306,048
3Feb 11, 2026 18:186,14274,075,70447,982,0002,998,0002,465,792
4Feb 11, 2026 18:186,36176,410,54251,797,000996,0002,510,848
5Feb 11, 2026 18:186,41980,381,13050,264,0003,015,0002,433,024
6Feb 11, 2026 18:186,56883,235,60351,485,0003,028,0002,306,048