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 17, 2024 01:31zielajzielajScore: 3,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 01:313,51451,749,93127,158,0002,011,0002,457,600
2Nov 17, 2024 01:313,53154,138,12427,290,0002,021,0002,383,872
3Nov 17, 2024 01:393,54554,844,99729,420,00002,379,776
4Nov 17, 2024 01:313,55147,600,69228,460,0001,016,0002,523,136
5Nov 17, 2024 01:393,55352,425,36229,486,00002,379,776
6Nov 17, 2024 01:393,55352,155,85128,471,0001,016,0002,523,136
7Nov 17, 2024 01:393,72055,511,13228,885,0001,992,0002,531,328
8Nov 17, 2024 01:313,73452,370,73128,997,0001,999,0002,531,328
9Nov 17, 2024 01:393,73555,238,67028,999,0001,999,0002,396,160
10Nov 17, 2024 01:393,73957,641,33329,033,0002,002,0002,269,184
11Nov 17, 2024 01:313,74352,063,56129,066,0002,004,0002,392,064
12Nov 17, 2024 01:313,74656,498,88329,087,0002,006,0002,527,232