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 listMar 24, 2026 16:05Dominique GarmierDominique GarmierScore: 12,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 16:059,259106,023,22773,927,0001,998,0002,506,752
2Mar 24, 2026 16:0512,471129,470,90499,254,0003,007,0002,457,600
3Mar 24, 2026 16:0512,737127,451,882102,433,0002,008,0002,383,872