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 listJun 26, 2026 10:12Victor MerckléVictor MerckléScore: 4,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 10:134,35243,814,81735,024,0001,099,0002,113,536
2Jun 26, 2026 10:134,35943,911,49935,096,0001,087,0002,113,536
3Jun 26, 2026 10:134,36143,861,09435,125,0001,078,0002,113,536
4Jun 26, 2026 10:134,37648,301,05335,199,0001,126,0002,113,536
5Jun 26, 2026 10:134,39645,481,62735,481,0001,006,0002,113,536
6Jun 26, 2026 10:134,39844,147,37035,495,0001,012,0002,113,536
7Jun 26, 2026 10:134,40844,272,03935,565,0001,026,0002,113,536
8Jun 26, 2026 10:134,43044,487,68135,687,0001,083,0002,113,536
9Jun 26, 2026 10:134,43144,426,09635,771,0001,012,0002,113,536