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 14:27olliecrowolliecrowScore: 12,161Success
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 14:2712,136123,057,73698,514,0001,005,0002,277,376
2Mar 4, 2026 14:2712,161130,126,26397,725,0001,994,0002,408,448
3Mar 4, 2026 14:2712,167128,089,22196,775,0002,993,0002,453,504