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 19:53e1011e1011Score: 142,589Success
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 19:54115,225956,235,945803,514,000141,331,0002,113,536
2Nov 4, 2026 19:54123,9291,027,707,150875,434,000140,785,0002,113,536
3Nov 4, 2026 19:54130,0741,078,043,287926,209,000140,399,0002,113,536
4Nov 4, 2026 19:54138,0751,143,642,784991,611,000140,606,0002,113,536
5Nov 4, 2026 19:54142,5891,180,740,3691,027,979,000141,256,0002,113,536
6Nov 4, 2026 19:54144,3641,195,288,0961,042,128,000141,663,0002,113,536
7Nov 4, 2026 19:54155,4581,285,778,8221,133,407,000141,356,0002,113,536
8Nov 4, 2026 19:54168,0241,389,248,2231,237,482,000140,315,0002,113,536
9Nov 4, 2026 19:54170,3851,408,085,6051,255,702,000141,458,0002,113,536