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 24, 2026 21:31Kevin HeaveyKevin HeaveyScore: 3,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:323,56240,346,29628,528,0001,043,0002,113,536
2Jul 24, 2026 21:323,56246,556,72528,518,0001,049,0002,113,536
3Jul 24, 2026 21:323,57140,627,14728,399,0001,243,0002,113,536
4Jul 24, 2026 21:323,58940,627,78928,572,0001,222,0002,113,536
5Jul 24, 2026 21:323,60840,791,37728,756,0001,198,0002,113,536
6Jul 24, 2026 21:323,61640,911,70728,966,0001,051,0002,113,536
7Jul 24, 2026 21:323,61940,772,34428,851,0001,194,0002,113,536
8Jul 24, 2026 21:323,86542,883,09030,880,0001,204,0002,117,632
9Jul 24, 2026 21:323,86842,946,20230,906,0001,199,0002,113,536