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 listSep 14, 2026 10:54Kevin HeaveyKevin HeaveyScore: 3,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:553,55938,339,81228,401,0001,146,0002,113,536
2Sep 14, 2026 10:553,79141,009,92930,274,0001,196,0002,113,536
3Sep 14, 2026 10:553,81040,874,58630,416,0001,207,0002,113,536
4Sep 14, 2026 10:553,83041,271,89030,577,0001,212,0002,113,536
5Sep 14, 2026 10:553,83741,327,38230,667,0001,181,0002,113,536
6Sep 14, 2026 10:553,85241,420,01130,781,0001,198,0002,113,536
7Sep 14, 2026 10:553,85641,556,19430,977,0001,030,0002,113,536
8Sep 14, 2026 10:553,86744,449,73531,041,0001,057,0002,113,536
9Sep 14, 2026 10:554,15752,292,36233,408,0001,098,0002,113,536