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 12, 2026 23:53Jarry XiaoJarry XiaoScore: 19,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 23:5419,296182,861,456159,152,0001,007,0002,117,632
2Jul 12, 2026 23:5419,510171,674,700160,933,0001,007,0002,117,632
3Jul 12, 2026 23:5419,515171,685,758160,968,0001,009,0002,117,632
4Jul 12, 2026 23:5419,523171,648,650161,034,0001,008,0002,117,632
5Jul 12, 2026 23:5419,523171,741,406161,042,0001,006,0002,117,632
6Jul 12, 2026 23:5419,556172,133,465161,311,0001,008,0002,117,632
7Jul 12, 2026 23:5419,582172,152,354161,526,0001,006,0002,117,632
8Jul 12, 2026 23:5419,623172,549,171161,871,0001,007,0002,117,632
9Jul 12, 2026 23:5419,672172,900,275162,273,0001,009,0002,117,632