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 01:06Dominique GarmierDominique GarmierScore: 157,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 22:47157,5251,316,926,1851,289,704,0001,997,0002,289,664
2Mar 21, 2026 03:15157,6961,319,861,6881,292,111,000999,0002,326,528
3Mar 21, 2026 03:15157,7001,322,410,7051,292,141,000999,0002,285,568
4Mar 21, 2026 03:15157,7011,325,083,8361,292,148,000999,0002,285,568
5Mar 20, 2026 22:47157,7971,324,863,7581,292,933,000999,0002,281,472
6Mar 21, 2026 01:06157,9051,329,051,6511,293,821,0001,000,0002,281,472
7Mar 20, 2026 22:47158,0171,323,672,1251,295,742,00002,277,376
8Mar 21, 2026 01:06158,1041,327,142,5901,295,455,000999,0002,330,624
9Mar 21, 2026 01:06158,3901,332,937,4511,296,798,0001,998,0002,281,472