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 21:26Joshua MontrossJoshua MontrossScore: 21,124Success
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 21:3021,042191,394,931173,446,0001,206,0002,113,536
2Jul 6, 2026 21:3021,080184,594,813173,794,0001,177,0002,113,536
3Jul 6, 2026 21:3021,095184,627,235173,949,0001,147,0002,113,536
4Jul 6, 2026 21:3021,103193,630,151173,882,0001,279,0002,113,536
5Jul 6, 2026 21:3021,124186,347,597174,334,0001,003,0002,113,536
6Jul 6, 2026 21:3021,126196,374,179174,331,0001,020,0002,113,536
7Jul 6, 2026 21:3021,139200,351,662174,451,0001,005,0002,113,536
8Jul 6, 2026 21:3021,183185,514,986174,811,0001,012,0002,113,536
9Jul 6, 2026 21:3021,590188,818,920178,019,0001,184,0002,113,536