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 23, 2026 19:36Matthias GörgensMatthias GörgensScore: 7,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 19:377,44372,210,23958,006,0003,033,0002,113,536
2Sep 23, 2026 19:377,63372,913,54059,454,0003,140,0002,113,536
3Sep 23, 2026 19:377,64373,030,79459,560,0003,120,0002,113,536
4Sep 23, 2026 19:377,66373,189,29159,745,0003,095,0002,113,536
5Sep 23, 2026 19:377,68074,242,97359,895,0003,084,0002,113,536
6Sep 23, 2026 19:377,68174,132,44859,909,0003,083,0002,113,536
7Sep 23, 2026 19:377,84574,671,24061,289,0003,041,0002,113,536
8Sep 23, 2026 19:377,86974,967,61961,497,0003,036,0002,113,536
9Sep 23, 2026 19:377,88177,152,14961,594,0003,031,0002,113,536