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 03:34Dominique GarmierDominique GarmierScore: 89,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 16:0464,448553,360,815446,710,00081,763,0002,273,280
2Mar 23, 2026 16:0473,084628,400,544518,384,00080,903,0002,281,472
3Mar 23, 2026 16:0483,699716,606,620604,415,00081,920,0002,420,736
4Mar 24, 2026 03:3489,065758,985,725647,411,00082,924,0002,412,544
5Mar 24, 2026 03:3496,866820,395,046711,479,00082,822,0002,293,760
6Mar 24, 2026 03:34104,476882,794,970774,831,00081,876,0002,293,760