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 26, 2026 02:04sophiasophiaScore: 59,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 02:0459,638522,764,999493,998,000999,0002,523,136
2Feb 26, 2026 02:0459,707528,085,534494,569,000999,0002,383,872
3Feb 26, 2026 02:0459,760521,372,758495,008,0001,000,0002,506,752
4Feb 26, 2026 02:0459,863524,609,622494,861,0001,999,0002,514,944
5Feb 26, 2026 02:0459,904520,679,686497,205,00002,523,136
6Feb 26, 2026 02:0459,947524,116,737497,563,00002,502,656
7Feb 26, 2026 02:0459,953523,217,320496,612,000999,0002,523,136
8Feb 26, 2026 02:0459,958527,674,913493,653,0003,997,0002,523,136
9Feb 26, 2026 02:0459,969523,679,796494,742,0002,998,0002,523,136