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 listOct 25, 2026 10:26e1011e1011Score: 333,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 10:28200,8252,097,478,8951,050,649,000596,117,0002,134,016
2Oct 25, 2026 10:28237,2693,848,616,9521,258,400,000687,211,0002,117,632
3Oct 25, 2026 10:28247,0222,294,159,4131,363,219,000662,362,0002,146,304
4Oct 25, 2026 10:28247,2923,461,848,6001,270,847,000756,949,0002,134,016
5Oct 25, 2026 10:28333,5364,930,679,1451,449,734,0001,285,263,0002,154,496
6Oct 25, 2026 10:28335,1373,693,308,9461,744,721,0001,003,408,0002,142,208
7Oct 25, 2026 10:28471,6847,337,997,5002,173,570,0001,694,241,0002,142,208
8Oct 25, 2026 10:28501,9978,953,260,9602,115,330,0002,001,047,0002,117,632
9Oct 25, 2026 10:28725,76712,270,462,3312,777,264,0003,174,029,0002,150,400