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 listJul 7, 2025 09:15Valentin KofmanValentin KofmanScore: 14,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 09:1514,731145,032,851118,801,0001,996,0002,285,568
2Jul 7, 2025 09:1514,739144,579,204118,860,0001,997,0002,265,088
3Jul 7, 2025 09:1514,743145,805,107118,896,0001,998,0002,285,568