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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:167,74073,963,23863,203,0001,046,0002,113,536
2May 24, 2026 15:167,74173,707,64063,204,0001,052,0002,113,536
3May 24, 2026 15:167,74273,790,20063,223,0001,038,0002,113,536
4May 24, 2026 15:167,74874,143,71663,261,0001,052,0002,113,536
5May 24, 2026 15:167,74974,249,87463,265,0001,057,0002,113,536
6May 24, 2026 15:167,75372,560,39663,304,0001,046,0002,113,536
7May 24, 2026 15:167,75472,153,72563,312,0001,053,0002,113,536
8May 24, 2026 15:167,75674,210,28463,312,0001,071,0002,113,536
9May 24, 2026 15:167,75772,999,86663,341,0001,049,0002,113,536