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 16, 2025 18:09sheryllynn24sheryllynn24Score: 33,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 18:0932,373293,711,375267,699,000998,0002,265,088
2Sep 16, 2025 18:0932,447290,730,870267,309,0002,002,0002,273,280
3Sep 16, 2025 18:0932,452305,001,780267,348,0002,002,0002,469,888
4Sep 16, 2025 18:0933,470308,193,671275,807,0001,998,0002,265,088
5Sep 16, 2025 18:0933,471309,404,981276,812,000999,0002,269,184
6Sep 16, 2025 18:0933,472304,164,578276,817,000999,0002,277,376
7Sep 16, 2025 18:0933,475301,664,126274,848,0002,998,0002,277,376
8Sep 16, 2025 18:0933,481304,704,978275,892,0001,999,0002,277,376
9Sep 16, 2025 18:0933,490304,505,316273,972,0003,999,0002,277,376