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 16, 2026 20:23olliecrowolliecrowScore: 8,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 20:238,23387,356,34865,492,0002,015,0002,461,696
2Apr 16, 2026 20:238,27493,169,08767,843,00002,314,240
3Apr 16, 2026 20:238,47692,400,66966,484,0003,022,0002,510,848