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 listJul 8, 2025 19:13Adam FolwarcznyAdam FolwarcznyScore: 17,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 19:1316,319157,543,689120,833,00012,982,0002,416,640
2Jul 8, 2025 19:1317,077166,789,869123,027,00017,003,0002,461,696
3Jul 8, 2025 19:1318,502178,765,080136,743,00014,971,0002,494,464