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 6, 2026 12:51Teow Hua JunTeow Hua JunScore: 11,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 12:5611,646106,021,00295,467,0001,198,0002,113,536
2Jul 6, 2026 12:5611,651106,195,73095,480,0001,226,0002,113,536
3Jul 6, 2026 12:5611,656106,069,70195,540,0001,211,0002,113,536
4Jul 6, 2026 12:5611,682106,401,41695,768,0001,198,0002,113,536
5Jul 6, 2026 12:5611,687106,369,58595,807,0001,198,0002,113,536
6Jul 6, 2026 12:5611,694106,435,74495,921,0001,143,0002,113,536
7Jul 6, 2026 12:5611,708108,048,64696,050,0001,132,0002,113,536
8Jul 6, 2026 12:5611,716106,770,66995,980,0001,271,0002,113,536
9Jul 6, 2026 12:5611,717106,660,61896,052,0001,207,0002,113,536