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 19, 2026 13:24Serhii SakhnoSerhii SakhnoScore: 86,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 13:2486,170742,100,021714,214,0001,000,0002,277,376
2Feb 19, 2026 13:2486,175742,106,740714,256,0001,000,0002,277,376
3Feb 19, 2026 13:2486,180745,698,073714,295,0001,000,0002,277,376
4Feb 19, 2026 13:2486,187742,804,552713,349,0002,000,0002,293,760
5Feb 19, 2026 13:2486,187743,305,190714,349,000999,0002,531,328
6Feb 19, 2026 13:2486,188740,722,135712,361,0002,997,0002,277,376
7Feb 19, 2026 13:2486,200741,124,994713,461,0001,998,0002,277,376
8Feb 19, 2026 13:2486,203739,676,860713,486,0001,998,0002,523,136
9Feb 19, 2026 13:2486,338743,039,436713,609,0002,998,0002,277,376