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 listJun 28, 2025 15:10Valentin KofmanValentin KofmanScore: 7,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 15:106,04372,985,39448,147,0002,006,0002,281,472
2Jun 28, 2025 15:106,04377,010,38148,150,0002,006,0002,289,664
3Jun 28, 2025 15:106,04874,477,41749,196,0001,004,0002,289,664
4Jun 28, 2025 15:106,05477,681,61848,236,0002,009,0002,289,664
5Jun 28, 2025 15:106,05972,425,22648,280,0002,011,0002,273,280
6Jun 28, 2025 15:106,07672,373,35248,416,0002,017,0002,273,280
7Jun 28, 2025 15:107,93291,774,56565,832,00002,281,472
8Jun 28, 2025 15:107,95889,591,33164,051,0002,001,0002,273,280
9Jun 28, 2025 15:107,96289,412,20364,081,0002,002,0002,289,664
10Jun 28, 2025 15:107,97094,959,87464,143,0002,004,0002,289,664
11Jun 28, 2025 15:107,97291,952,44764,165,0002,005,0002,281,472
12Jun 28, 2025 15:108,00393,355,05165,418,0001,006,0002,289,664