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 listApr 25, 2026 07:48limanjun99limanjun99Score: 4,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 07:494,23952,623,04030,788,0003,972,0002,502,656
2Apr 25, 2026 07:494,24755,442,13231,842,0002,985,0002,494,464
3Apr 25, 2026 07:494,26554,329,75831,976,0002,997,0002,457,600
4Apr 25, 2026 07:494,27056,230,86332,017,0003,001,0002,514,944
5Apr 25, 2026 07:494,28548,916,71232,131,0003,012,0002,318,336
6Apr 25, 2026 07:494,29252,516,35430,168,0005,028,0002,490,368
7Apr 25, 2026 07:494,31251,621,15532,335,0003,031,0002,469,888
8Apr 25, 2026 07:494,31850,656,31933,386,0002,023,0002,469,888
9Apr 25, 2026 07:494,32158,361,59334,428,0001,012,0002,457,600