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 5, 2026 04:32e1011e1011Score: 14,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:3314,285128,036,794115,128,0002,014,0002,113,536
2Nov 5, 2026 04:3314,326128,328,048115,279,0002,195,0002,113,536
3Nov 5, 2026 04:3314,336128,978,105115,535,0002,022,0002,113,536
4Nov 5, 2026 04:3314,337128,481,835115,537,0002,030,0002,113,536
5Nov 5, 2026 04:3314,339128,538,194115,559,0002,021,0002,113,536
6Nov 5, 2026 04:3314,365128,799,011115,775,0002,023,0002,113,536
7Nov 5, 2026 04:3314,374128,762,341115,849,0002,021,0002,113,536
8Nov 5, 2026 04:3314,651130,989,687118,118,0002,024,0002,113,536
9Nov 5, 2026 04:3314,756131,888,805118,983,0002,021,0002,113,536