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 1, 2026 10:41limanjun99limanjun99Score: 6,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 10:426,80373,154,30154,456,0002,016,0002,514,944
2May 1, 2026 10:426,81973,947,35254,583,0002,021,0002,510,848
3May 1, 2026 10:426,82374,202,63654,611,0002,022,0002,523,136
4May 1, 2026 10:426,84173,295,61754,760,0002,028,0002,514,944
5May 1, 2026 10:426,86072,674,41353,945,0002,996,0002,510,848
6May 1, 2026 10:426,87175,495,60754,035,0003,001,0002,506,752
7May 1, 2026 10:426,87177,226,51854,034,0003,001,0002,506,752
8May 1, 2026 10:426,91073,981,50855,343,0002,012,0002,519,040
9May 1, 2026 10:426,91577,780,80655,385,0002,014,0002,519,040