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 listSep 19, 2026 19:56Andrew EpsteinAndrew EpsteinScore: 68,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:5767,810566,467,805555,044,0001,002,0002,117,632stderr
2Sep 19, 2026 19:5767,892567,935,100555,680,0001,036,0002,117,632stderr
3Sep 19, 2026 19:5767,981567,830,242556,424,0001,028,0002,117,632stderr
4Sep 19, 2026 19:5768,117568,954,259557,536,0001,027,0002,117,632stderr
5Sep 19, 2026 19:5768,254570,783,348558,687,0001,003,0002,117,632stderr
6Sep 19, 2026 19:5768,864575,176,007563,688,0001,002,0002,117,632stderr
7Sep 19, 2026 19:5768,888575,355,717563,879,0001,003,0002,117,632stderr
8Sep 19, 2026 19:5769,117577,213,801565,732,0001,030,0002,117,632stderr
9Sep 19, 2026 19:5769,390579,576,728567,998,0001,001,0002,117,632stderr