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 21, 2026 22:27Dominique GarmierDominique GarmierScore: 10,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:2710,538112,356,06285,407,0001,004,0002,379,776
2Mar 21, 2026 22:2710,547114,106,09583,467,0003,016,0002,269,184
3Mar 21, 2026 22:2710,578112,826,07484,746,0001,994,0002,375,680
4Mar 21, 2026 22:2710,609119,789,15880,997,0005,999,0002,351,104
5Mar 21, 2026 22:2710,612118,572,46284,020,0003,000,0002,387,968
6Mar 21, 2026 22:2710,612117,329,01884,021,0003,000,0002,482,176
7Mar 21, 2026 22:2710,627116,099,85184,136,0003,004,0002,273,280
8Mar 21, 2026 22:2710,681112,541,43685,594,0001,990,0002,437,120
9Mar 21, 2026 22:2710,813114,186,72786,652,0002,015,0002,469,888