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: 15,090Success
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:0414,874132,851,229119,952,0002,022,0002,113,536
2Nov 4, 2026 22:0414,957133,450,264120,623,0002,028,0002,113,536
3Nov 4, 2026 22:0415,078134,517,358121,612,0002,033,0002,113,536
4Nov 4, 2026 22:0415,085136,646,400121,678,0002,023,0002,113,536
5Nov 4, 2026 22:0415,090137,256,164121,722,0002,017,0002,113,536
6Nov 4, 2026 22:0415,110134,774,066121,891,0002,012,0002,113,536
7Nov 4, 2026 22:0415,122136,184,191121,992,0002,014,0002,113,536
8Nov 4, 2026 22:0415,168135,294,469122,355,0002,027,0002,113,536
9Nov 4, 2026 22:0415,187135,402,675122,509,0002,031,0002,113,536