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 23, 2026 01:24Dominique GarmierDominique GarmierScore: 16,592Success
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 01:2416,570162,547,393132,877,0002,997,0002,351,104
2Mar 23, 2026 01:2416,592163,315,253134,057,0002,000,0002,506,752
3Mar 23, 2026 01:2416,711154,218,649135,033,0002,000,0002,289,664