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 22, 2026 23:42Dominique GarmierDominique GarmierScore: 16,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 23:4216,700165,569,178134,937,0001,999,0002,449,408
2Mar 23, 2026 00:0416,736164,689,287133,230,0004,006,0002,404,352
3Mar 23, 2026 00:0416,793163,348,095134,709,0002,993,0002,478,080
4Mar 22, 2026 23:4216,805166,094,969135,808,0001,997,0002,392,064
5Mar 22, 2026 23:4216,818162,933,714135,911,0001,998,0002,428,928
6Mar 23, 2026 00:0417,083168,345,302137,076,0003,001,0002,486,272