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 11, 2025 08:41Valentin KofmanValentin KofmanScore: 7,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 08:416,50575,945,15535,226,00018,116,0002,416,640
2Jul 11, 2025 08:417,31085,096,68740,958,00018,980,0002,387,968
3Jul 11, 2025 08:417,50289,220,68643,367,00018,153,0002,371,584