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 14, 2026 01:15Jarry XiaoJarry XiaoScore: 12,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 01:1612,978117,311,925106,708,0001,015,0002,121,728stderr
2Jul 14, 2026 01:1612,983117,323,823106,746,0001,014,0002,121,728stderr
3Jul 14, 2026 01:1612,986117,433,705106,773,0001,015,0002,121,728stderr
4Jul 14, 2026 01:1612,990117,458,475106,803,0001,016,0002,121,728stderr
5Jul 14, 2026 01:1612,996117,535,866106,859,0001,016,0002,121,728stderr
6Jul 14, 2026 01:1612,999117,585,923106,880,0001,016,0002,121,728stderr
7Jul 14, 2026 01:1613,058118,004,281107,368,0001,015,0002,121,728stderr
8Jul 14, 2026 01:1613,195119,125,824108,505,0001,014,0002,121,728stderr
9Jul 14, 2026 01:1617,995158,856,380148,353,0001,006,0002,121,728stderr