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 listJul 27, 2025 19:04Ruoyu QiuRuoyu QiuScore: 80,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 19:0480,331690,732,588664,749,0001,999,0002,285,568
2Jul 27, 2025 19:0480,333701,011,634666,763,00002,277,376
3Jul 27, 2025 19:0480,333689,315,171664,769,0001,999,0002,285,568
4Jul 27, 2025 19:0480,334689,392,206664,771,0001,999,0002,260,992
5Jul 27, 2025 19:0480,345695,732,310664,861,0001,999,0002,285,568
6Jul 27, 2025 19:0480,346690,588,823664,871,0001,999,0002,260,992
7Jul 27, 2025 19:0480,349688,622,396665,894,000999,0002,285,568
8Jul 27, 2025 19:0480,353691,032,518665,934,000999,0002,269,184
9Jul 27, 2025 19:0480,354694,980,786665,943,000999,0002,269,184