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 22, 2026 20:43Dominique GarmierDominique GarmierScore: 21,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:4321,715202,465,78590,031,00088,030,0002,490,368
2Mar 22, 2026 20:4321,781204,240,76790,799,00087,806,0002,379,776
3Mar 22, 2026 20:4321,943207,656,92888,967,00090,966,0002,437,120