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 14, 2026 11:08Dominique GarmierDominique GarmierScore: 13,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 11:0813,048130,794,838104,995,0001,999,0002,506,752
2Mar 14, 2026 11:0813,052128,639,347106,029,0001,000,0002,322,432
3Mar 14, 2026 11:0813,059132,208,743104,080,0003,002,0002,273,280
4Mar 14, 2026 11:0813,069133,393,294105,161,0002,003,0002,334,720
5Mar 14, 2026 11:0813,072135,051,589105,184,0002,003,0002,510,848
6Mar 14, 2026 11:0813,074140,228,761105,200,0002,003,0002,314,240
7Mar 14, 2026 11:0813,077133,601,794104,224,0003,006,0002,277,376
8Mar 14, 2026 11:0813,081129,792,808105,262,0002,004,0002,273,280
9Mar 14, 2026 11:0813,090130,480,124106,339,0001,003,0002,322,432