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: 58,790Success
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:2558,752512,324,120484,644,0002,997,0002,523,136
2Feb 1, 2025 22:2558,758518,039,038487,688,00002,449,408
3Feb 1, 2025 22:2558,766519,671,317486,755,000999,0002,445,312
4Feb 1, 2025 22:2558,788514,030,224486,938,000999,0002,445,312
5Feb 1, 2025 22:2558,790515,016,894486,958,000999,0002,265,088
6Feb 1, 2025 22:2558,793507,728,525487,983,00002,449,408
7Feb 1, 2025 22:2558,795510,118,078485,997,0001,999,0002,523,136
8Feb 1, 2025 22:2558,824507,711,997486,242,0002,000,0002,265,088
9Feb 1, 2025 22:2558,990514,629,309486,616,0002,997,0002,523,136