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:51Serhii SakhnoSerhii SakhnoScore: 73,360Success
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:5173,320638,062,260606,562,0001,998,0002,277,376
2Feb 20, 2026 00:5173,329632,309,769605,636,0002,998,0002,265,088
3Feb 20, 2026 00:5173,337635,832,431606,702,0001,999,0002,277,376
4Feb 20, 2026 00:5173,340634,726,352606,719,0001,999,0002,277,376
5Feb 20, 2026 00:5173,360636,075,476606,889,0001,999,0002,371,584
6Feb 20, 2026 00:5173,383635,766,125609,081,00002,277,376
7Feb 20, 2026 00:5173,402632,787,779608,238,0001,000,0002,277,376
8Feb 20, 2026 00:5173,412633,107,698605,328,0003,995,0002,510,848
9Feb 20, 2026 00:5173,435634,750,416608,511,000999,0002,277,376