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 16, 2026 09:50tch1001tch1001Score: 70,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 09:5070,185611,227,917582,534,00002,396,160
2Feb 16, 2026 09:5070,188613,745,121582,564,00002,523,136
3Feb 16, 2026 09:5070,191617,651,810580,587,0001,998,0002,273,280
4Feb 16, 2026 09:5070,194609,103,575580,613,0001,998,0002,273,280
5Feb 16, 2026 09:5070,196606,915,048581,628,000999,0002,273,280
6Feb 16, 2026 09:5070,202606,845,571581,679,000999,0002,273,280
7Feb 16, 2026 09:5070,209610,077,692579,737,0002,998,0002,273,280
8Feb 16, 2026 09:5070,213608,667,126580,767,0001,999,0002,273,280
9Feb 16, 2026 09:5070,216605,712,450579,794,0002,998,0002,273,280