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 13, 2026 13:24Victor MerckléVictor MerckléScore: 7,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 13:257,90074,897,01165,577,00002,113,536
2May 13, 2026 13:257,90074,768,44564,572,0001,004,0002,113,536
3May 13, 2026 13:257,90175,112,12164,578,0001,008,0002,113,536
4May 13, 2026 13:257,90672,880,66564,584,0001,043,0002,113,536
5May 13, 2026 13:257,90672,881,61764,623,0001,004,0002,113,536
6May 13, 2026 13:257,90972,963,03565,646,00002,113,536
7May 13, 2026 13:257,91072,965,46764,630,0001,023,0002,113,536
8May 13, 2026 13:257,91175,749,25464,617,0001,046,0002,113,536
9May 13, 2026 13:257,91373,741,11564,660,0001,023,0002,113,536