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 6, 2025 12:13Valentin KofmanValentin KofmanScore: 17,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 12:1317,450167,729,099142,090,0001,000,0002,285,568
2Jul 6, 2025 12:1317,515176,054,812141,629,0001,994,0002,510,848
3Jul 6, 2025 12:1317,563167,316,651142,018,0002,000,0002,260,992