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 18:13Andrew EpsteinAndrew EpsteinScore: 20,610Success
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 18:1420,447178,096,596166,659,0001,007,0002,117,632stderr
2Sep 19, 2026 18:1420,496179,323,500167,063,0001,005,0002,117,632stderr
3Sep 19, 2026 18:1420,531183,042,342167,351,0001,007,0002,117,632stderr
4Sep 19, 2026 18:1420,609179,386,788167,994,0001,005,0002,117,632stderr
5Sep 19, 2026 18:1420,610180,130,586167,999,0001,006,0002,117,632stderr
6Sep 19, 2026 18:1420,737180,549,182169,045,0001,006,0002,117,632stderr
7Sep 19, 2026 18:1435,444301,089,857289,642,0001,005,0002,117,632stderr
8Sep 19, 2026 18:1436,240308,193,153296,166,0001,004,0002,117,632stderr
9Sep 19, 2026 18:1436,275307,782,784296,454,0001,003,0002,117,632stderr