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 listMay 16, 2026 00:38Victor MerckléVictor MerckléScore: 6,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:396,96765,566,83356,823,0001,007,0002,113,536
2May 16, 2026 00:396,96867,355,63856,793,0001,043,0002,113,536
3May 16, 2026 00:396,97466,618,39356,835,0001,050,0002,113,536
4May 16, 2026 00:396,97567,176,20256,884,0001,016,0002,117,632
5May 16, 2026 00:396,97566,176,47256,894,0001,001,0002,113,536
6May 16, 2026 00:396,97865,775,19056,918,0001,001,0002,117,632
7May 16, 2026 00:396,98566,106,44556,892,0001,087,0002,113,536
8May 16, 2026 00:397,02065,555,91157,257,0001,009,0002,117,632
9May 16, 2026 00:397,02365,624,92257,286,0001,008,0002,113,536