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 listDec 8, 2025 09:19warshipwarshipScore: 56,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 09:1956,076495,721,817464,431,0001,000,0002,269,184
2Dec 8, 2025 09:1956,079492,848,785464,454,0001,000,0002,285,568
3Dec 8, 2025 09:1956,109494,745,745463,704,0001,998,0002,285,568
4Dec 8, 2025 09:1956,110490,678,759463,717,0001,998,0002,269,184
5Dec 8, 2025 09:1956,125491,615,604463,835,0001,999,0002,260,992
6Dec 8, 2025 09:1956,128489,628,640463,864,0001,999,0002,285,568
7Dec 8, 2025 09:1956,143488,190,358463,986,0001,999,0002,527,232
8Dec 8, 2025 09:1956,289490,548,142466,202,0001,000,0002,277,376
9Dec 8, 2025 09:1956,296493,933,979466,253,0001,000,0002,285,568