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 listSep 26, 2026 21:50Karthik ReddyKarthik ReddyScore: 4,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 21:524,75049,728,61838,090,0001,336,00020,480
2Sep 26, 2026 21:524,80350,232,13838,783,0001,083,00020,480
3Sep 26, 2026 21:524,83150,383,51038,772,0001,328,00020,480
4Sep 26, 2026 21:524,83750,414,86038,649,0001,500,00020,480
5Sep 26, 2026 21:524,86350,570,16839,023,0001,341,00020,480
6Sep 26, 2026 21:524,87250,698,03139,106,0001,333,00020,480
7Sep 26, 2026 21:524,87450,725,02538,996,0001,463,00020,480
8Sep 26, 2026 21:524,88050,802,56339,031,0001,475,00020,480
9Sep 26, 2026 21:524,90150,933,75738,344,0002,339,00020,480