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 listMar 13, 2026 05:46olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 20, 2026 23:27zielaj10.00RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:27023,168,88901,007,000385,024Exit with code 1: 1 000306c3 02100800 7ffafbff bfebfbff 7 00000000 000027ab 00000000 9c000600 x 0000000000000007stderr
2Mar 13, 2026 05:462,09138,740,62017,357,00002,531,328
3Mar 13, 2026 05:462,09240,299,72117,360,00002,273,280
4Mar 13, 2026 05:462,10531,726,41217,471,00002,506,752