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 23, 2026 14:19satoru.netsatoru.netScore: 58,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 14:1958,230504,881,293483,309,00002,387,968
2Feb 23, 2026 14:1958,236513,210,611482,357,0001,000,0002,396,160
3Feb 23, 2026 14:1958,266509,268,794482,609,000999,0002,273,280
4Feb 23, 2026 14:1958,269516,984,642482,631,000999,0002,400,256
5Feb 23, 2026 14:1958,278514,670,208481,711,0001,998,0002,396,160
6Feb 23, 2026 14:1958,282518,521,383482,740,000999,0002,392,064
7Feb 23, 2026 14:1958,286509,714,508482,777,000999,0002,404,352
8Feb 23, 2026 14:1958,299510,613,307481,882,0001,999,0002,396,160
9Feb 23, 2026 14:1958,366512,455,418482,436,0002,001,0002,273,280