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 18, 2026 09:23CheckHarryCheckHarryScore: 48,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 09:2348,614436,835,558401,502,0001,997,0002,527,232
2Feb 18, 2026 09:2348,626427,334,921402,596,000998,0002,527,232
3Feb 18, 2026 09:2348,627431,671,834401,603,0001,998,0002,527,232
4Feb 18, 2026 09:2348,628430,334,553403,612,00002,523,136
5Feb 18, 2026 09:2348,630430,152,187402,633,000999,0002,527,232
6Feb 18, 2026 09:2348,652434,105,422402,813,000999,0002,523,136
7Feb 18, 2026 09:2349,335439,312,132408,482,000998,0002,506,752
8Feb 18, 2026 09:2349,371436,237,133407,779,0001,998,0002,383,872
9Feb 18, 2026 09:2349,657440,861,627412,151,00002,523,136