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 3, 2026 12:14limanjun99limanjun99Score: 5,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 12:145,20759,890,49640,204,0003,015,0002,498,560
2May 3, 2026 12:145,21561,033,05139,263,0004,027,0002,416,640
3May 3, 2026 12:145,23362,987,44339,400,0004,041,0002,424,832
4May 3, 2026 12:145,25066,277,72039,524,0004,053,0002,383,872
5May 3, 2026 12:145,26962,750,36338,770,0004,970,0002,433,024
6May 3, 2026 12:145,27861,137,37738,832,0004,978,0002,433,024
7May 3, 2026 12:145,31461,698,49640,099,0004,009,0002,424,832
8May 3, 2026 12:145,32964,310,88041,222,0003,016,0002,428,928
9May 3, 2026 12:145,35963,840,14840,439,0004,043,0002,437,120