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 listNov 4, 2026 22:03e1011e1011Score: 14,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 22:0514,225128,066,253114,417,0002,230,0002,113,536
2Nov 4, 2026 22:0514,270128,139,051115,004,0002,016,0002,113,536
3Nov 4, 2026 22:0514,273128,597,941115,026,0002,016,0002,113,536
4Nov 4, 2026 22:0514,285127,985,129115,110,0002,032,0002,113,536
5Nov 4, 2026 22:0514,288128,582,185115,148,0002,016,0002,113,536
6Nov 4, 2026 22:0514,387128,911,408115,958,0002,023,0002,113,536
7Nov 4, 2026 22:0514,401129,568,309116,068,0002,026,0002,113,536
8Nov 4, 2026 22:0514,467129,484,551116,618,0002,015,0002,113,536
9Nov 4, 2026 22:0514,550130,156,107117,276,0002,039,0002,113,536