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 listAug 15, 2026 05:56Tomislav TunkovicTomislav TunkovicScore: 2,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 05:572,66630,445,97520,736,0001,129,0002,113,536
2Aug 15, 2026 05:572,66730,352,78420,756,0001,121,0002,113,536
3Aug 15, 2026 05:572,67230,994,43620,799,0001,112,0002,113,536
4Aug 15, 2026 05:572,67230,357,90520,778,0001,134,0002,113,536
5Aug 15, 2026 05:572,67430,136,81720,802,0001,127,0002,113,536
6Aug 15, 2026 05:572,67731,070,81920,831,0001,121,0002,113,536
7Aug 15, 2026 05:572,68131,035,45520,849,0001,138,0002,113,536
8Aug 15, 2026 05:572,68830,585,81021,025,0001,021,0002,113,536
9Aug 15, 2026 05:575,38552,644,40743,079,0001,086,0002,113,536