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 listMar 4, 2026 16:40olliecrowolliecrowScore: 12,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:4012,130121,515,93897,456,0002,009,0002,461,696
2Mar 4, 2026 16:4012,160129,161,84398,713,000997,0002,416,640
3Mar 4, 2026 16:4012,164126,285,85197,752,0001,994,0002,424,832