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 10:03Valentin KofmanValentin KofmanScore: 10,461Success
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 10:0310,458111,873,74784,758,000997,0002,289,664
2Jul 7, 2025 10:0310,461110,166,70883,786,0001,994,0002,297,856
3Jul 7, 2025 10:0310,462112,696,54384,795,000997,0002,400,256