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 listApr 17, 2026 10:21olliecrowolliecrowScore: 78,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 10:2177,852667,651,819637,389,000999,0002,273,280
2Apr 17, 2026 10:2178,373670,174,137639,664,0002,998,0002,461,696
3Apr 17, 2026 10:2178,431671,164,011642,138,0001,000,0002,338,816