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 3, 2026 18:00Joshua MontrossJoshua MontrossScore: 35,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:0135,157301,141,674290,714,0001,095,0002,113,536
2Jul 3, 2026 18:0135,175301,989,839290,849,0001,111,0002,113,536
3Jul 3, 2026 18:0135,175301,387,248290,806,0001,147,0002,113,536
4Jul 3, 2026 18:0135,796306,507,220296,059,0001,054,0002,113,536
5Jul 3, 2026 18:0135,819306,675,659296,293,0001,011,0002,113,536
6Jul 3, 2026 18:0135,820306,673,340296,255,0001,053,0002,113,536
7Jul 3, 2026 18:0135,821306,742,660296,228,0001,089,0002,113,536
8Jul 3, 2026 18:0135,831306,672,448296,398,0001,001,0002,113,536
9Jul 3, 2026 18:0135,831306,871,480296,323,0001,077,0002,113,536