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 listJan 13, 2024 02:31cashkarucashkaruScore: 93,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2024 02:3190,363804,687,799740,978,32002,289,664
2Jan 13, 2024 02:3193,370818,657,572765,636,84002,297,856
3Jan 13, 2024 02:31107,616950,120,301882,450,84502,265,088