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 3, 2026 05:19limanjun99limanjun99Score: 5,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:195,31962,293,01140,138,0004,013,0002,424,832
2May 3, 2026 05:195,34766,998,56340,347,0004,034,0002,441,216
3May 3, 2026 05:195,35566,235,72641,423,0003,030,0002,420,736
4May 3, 2026 05:195,36062,732,15740,444,0004,044,0002,433,024
5May 3, 2026 05:195,36164,701,77540,454,0004,045,0002,433,024
6May 3, 2026 05:195,37565,951,37941,572,0003,041,0002,424,832
7May 3, 2026 05:195,37662,343,56940,566,0004,056,0002,437,120
8May 3, 2026 05:195,39563,456,43439,806,0004,975,0002,433,024
9May 3, 2026 05:195,43560,352,52741,102,0004,009,0002,371,584