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:13Andrew EpsteinAndrew EpsteinScore: 30,820Success
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:1430,125258,163,240246,023,0001,003,0002,117,632stderr
2Sep 19, 2026 19:1430,487260,576,472248,993,0001,003,0002,117,632stderr
3Sep 19, 2026 19:1430,516261,345,576249,234,0001,004,0002,117,632stderr
4Sep 19, 2026 19:1430,552260,967,487249,530,0001,002,0002,117,632stderr
5Sep 19, 2026 19:1430,820263,792,671251,725,0001,005,0002,117,632stderr
6Sep 19, 2026 19:1430,937264,808,886252,681,0001,003,0002,117,632stderr
7Sep 19, 2026 19:1431,109265,549,583254,095,0001,005,0002,117,632stderr
8Sep 19, 2026 19:1431,538269,172,603257,613,0001,004,0002,117,632stderr
9Sep 19, 2026 19:1431,579269,360,258257,948,0001,003,0002,117,632stderr