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 listMar 24, 2026 19:19Dominique GarmierDominique GarmierScore: 10,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 19:1910,092112,223,68280,761,0001,994,0002,342,912
2Mar 24, 2026 19:1910,129107,613,07681,054,0002,001,0002,506,752
3Mar 24, 2026 19:1910,216108,819,42579,781,0003,989,0002,342,912