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 1, 2025 22:25HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 55,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 22:2555,319482,118,176459,150,00002,441,216
2Feb 1, 2025 22:2555,331483,990,614459,249,00002,523,136
3Feb 1, 2025 22:2555,336477,917,148459,292,00002,523,136
4Feb 1, 2025 22:2555,338489,451,757459,305,00002,523,136
5Feb 1, 2025 22:2555,622492,871,769460,663,000999,0002,527,232
6Feb 1, 2025 22:2555,665482,270,448461,018,0001,000,0002,265,088
7Feb 1, 2025 22:2555,665484,848,866461,021,0001,000,0002,523,136
8Feb 1, 2025 22:2555,668483,703,740462,047,00002,523,136
9Feb 1, 2025 22:2555,685485,373,818462,185,00002,441,216