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 22, 2024 20:47MatthiasMatthiasScore: 81,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 20:4781,577704,354,371675,090,0002,000,0002,289,664
2Nov 22, 2024 20:4781,584703,156,008677,149,00002,293,760
3Nov 22, 2024 20:4781,607704,346,470676,342,0001,000,0002,289,664
4Nov 22, 2024 20:4781,643700,167,831675,637,0001,998,0002,281,472
5Nov 22, 2024 20:4781,646698,535,710676,661,000999,0002,293,760
6Nov 22, 2024 20:4781,735708,484,370677,401,0001,000,0002,273,280
7Nov 22, 2024 20:4781,766705,193,761676,658,0001,998,0002,269,184
8Nov 22, 2024 20:4781,773702,548,710676,718,0001,999,0002,281,472
9Nov 22, 2024 20:4781,797706,352,194676,919,0001,999,0002,289,664