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 listNov 15, 2024 14:19ndbnndbnScore: 32,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 14:1932,762293,431,512269,928,0001,999,0002,490,368
2Nov 15, 2024 14:1932,770299,721,785270,995,000999,0002,482,176
3Nov 15, 2024 14:1932,788292,952,915271,138,0001,000,0002,478,080