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 21, 2026 20:27Dominique GarmierDominique GarmierScore: 13,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:2713,076134,267,385104,218,0003,006,0002,285,568
2Mar 21, 2026 20:2713,152136,219,967105,849,0001,997,0002,379,776
3Mar 21, 2026 20:2713,260140,662,356106,738,0001,995,0002,506,752