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 listJul 3, 2026 02:42f0xerif0xeriScore: 1,009,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:511,000,7528,215,933,4488,046,399,000159,771,0002,113,536
2Jul 3, 2026 02:511,009,5738,288,806,7408,119,995,000158,506,0002,113,536
3Jul 3, 2026 02:511,009,7168,289,331,1948,116,437,000163,235,0002,113,536