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 08:34Teow Hua JunTeow Hua JunScore: 10,993Success
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 08:3510,968100,359,67589,934,0001,101,0002,113,536
2Jul 6, 2026 08:3510,979100,420,07090,022,0001,106,0002,113,536
3Jul 6, 2026 08:3510,989100,570,14690,119,0001,094,0002,113,536
4Jul 6, 2026 08:3510,990100,564,90990,110,0001,113,0002,113,536
5Jul 6, 2026 08:3510,993100,534,08790,068,0001,176,0002,113,536
6Jul 6, 2026 08:3511,021100,890,05990,375,0001,103,0002,113,536
7Jul 6, 2026 08:3511,026100,938,11190,334,0001,188,0002,113,536
8Jul 6, 2026 08:3511,031100,981,52990,373,0001,185,0002,113,536
9Jul 6, 2026 08:3511,054101,165,36790,576,0001,176,0002,113,536