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 17:24Andrew EpsteinAndrew EpsteinScore: 23,430Success
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 17:2523,256201,227,913188,689,0002,012,0002,117,632stderr
2Sep 19, 2026 17:2523,340202,752,001188,380,0003,012,0002,117,632stderr
3Sep 19, 2026 17:2523,396202,262,237189,838,0002,012,0002,117,632stderr
4Sep 19, 2026 17:2523,424202,598,448188,902,0003,178,0002,117,632stderr
5Sep 19, 2026 17:2523,430202,564,172190,120,0002,013,0002,117,632stderr
6Sep 19, 2026 17:2523,493203,004,527189,613,0003,033,0002,117,632stderr
7Sep 19, 2026 17:2523,503203,155,096189,681,0003,050,0002,117,632stderr
8Sep 19, 2026 17:2523,614204,028,682190,489,0003,148,0002,117,632stderr
9Sep 19, 2026 17:2523,643204,378,841190,811,0003,069,0002,117,632stderr