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 21:08Kevin HeaveyKevin HeaveyScore: 3,741Success
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 21:093,72740,545,92329,917,0001,022,0002,117,632
2Jul 14, 2026 21:093,72940,561,91229,932,0001,025,0002,117,632
3Jul 14, 2026 21:093,73740,672,08830,000,0001,022,0002,117,632
4Jul 14, 2026 21:093,73840,604,09230,008,0001,024,0002,117,632
5Jul 14, 2026 21:093,74141,632,31330,031,0001,024,0002,117,632
6Jul 14, 2026 21:093,75440,841,74130,141,0001,025,0002,117,632
7Jul 14, 2026 21:093,75540,856,82130,146,0001,028,0002,117,632
8Jul 14, 2026 21:095,45654,910,85744,269,0001,017,0002,117,632
9Jul 14, 2026 21:095,56855,916,30345,202,0001,015,0002,117,632