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 listMay 1, 2026 16:51Victor MerckléVictor MerckléScore: 3,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:533,83047,161,93127,355,0004,052,0002,572,288
2May 1, 2026 16:533,85151,579,73730,561,0001,018,0002,498,560
3May 1, 2026 16:533,86646,231,04528,635,0003,068,0002,461,696
4May 1, 2026 16:533,91746,309,74628,111,0004,015,0002,351,104
5May 1, 2026 16:533,93150,128,40229,214,0003,022,0002,568,192
6May 1, 2026 16:5313,979132,529,562109,646,0004,983,0002,408,448
7May 1, 2026 16:5314,072133,844,303113,388,0002,006,0002,404,352
8May 1, 2026 16:5314,106135,293,561109,689,0005,983,0002,539,520
9May 1, 2026 16:5314,277134,518,206112,072,0005,003,0002,428,928