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 20, 2026 00:41Serhii SakhnoSerhii SakhnoScore: 73,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 00:4173,314635,077,126606,508,0001,998,0002,277,376
2Feb 20, 2026 00:4173,337634,284,637606,697,0001,999,0002,277,376
3Feb 20, 2026 00:4173,341636,106,306605,732,0002,998,0002,527,232
4Feb 20, 2026 00:4173,357631,581,680606,860,0001,999,0002,277,376
5Feb 20, 2026 00:4173,357632,568,685606,863,0001,999,0002,523,136
6Feb 20, 2026 00:4173,363634,027,581605,913,0002,999,0002,277,376
7Feb 20, 2026 00:4173,388632,969,578605,119,0004,000,0002,277,376
8Feb 20, 2026 00:4173,419635,328,939607,384,0001,997,0002,269,184
9Feb 20, 2026 00:4173,426632,282,468607,438,0001,998,0002,535,424