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 22, 2026 13:16SneedSneedScore: 76,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:1676,386658,078,106555,000,00079,000,0002,289,664
2Feb 22, 2026 13:1676,393656,611,881562,059,00072,007,0002,289,664
3Feb 22, 2026 13:1676,452662,082,515572,599,00061,956,0002,523,136
4Feb 22, 2026 13:1676,475658,550,230558,776,00075,969,0002,289,664
5Feb 22, 2026 13:1676,513660,650,046565,050,00070,006,0002,289,664
6Feb 22, 2026 13:1676,583656,448,048559,683,00075,957,0002,281,472
7Feb 22, 2026 13:1676,586658,963,477561,703,00073,960,0002,281,472
8Feb 22, 2026 13:1676,605660,182,171567,841,00067,981,0002,383,872
9Feb 22, 2026 13:1676,636657,488,455571,074,00065,008,0002,514,944