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 22, 2025 15:58Valentin KofmanValentin KofmanScore: 25,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 15:5825,410233,702,099208,904,0001,999,0002,273,280
2Jun 22, 2025 15:5825,411234,763,853208,912,0001,999,0002,273,280
3Jun 22, 2025 15:5825,412232,882,709209,918,000999,0002,273,280
4Jun 22, 2025 15:5825,412234,130,087208,918,0001,999,0002,289,664
5Jun 22, 2025 15:5825,425240,422,978209,028,0002,000,0002,277,376
6Jun 22, 2025 15:5825,430237,446,077210,069,0001,000,0002,277,376
7Jun 22, 2025 15:5825,434234,485,727209,099,0002,000,0002,289,664
8Jun 22, 2025 15:5825,459234,193,301209,311,0002,002,0002,277,376
9Jun 22, 2025 15:5825,459238,515,752211,311,00002,260,992