Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 20, 2021 12:33Andrey TsvetkovAndrey TsvetkovScore: 99,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 12:3389,935798,058,493737,463,35302,215,936
2Jun 20, 2021 12:3594,854845,588,312777,798,89902,203,648
3Jun 20, 2021 12:3697,770869,489,352801,710,31902,199,552
4Jun 20, 2021 12:3598,662877,114,714809,028,76602,220,032
5Jun 20, 2021 12:3699,571890,753,074816,482,39902,236,416
6Jun 20, 2021 12:33111,291979,583,806912,590,29602,191,360
7Jun 20, 2021 12:33124,6121,078,827,0011,021,819,30802,203,648
8Jun 20, 2021 12:35126,6201,102,263,8821,038,285,95702,195,456
9Jun 20, 2021 12:36129,6681,132,088,8121,063,275,34802,203,648