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 30, 2026 00:13Dominique GarmierDominique GarmierScore: 10,115Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 00:1310,059115,006,26281,482,0001,005,0002,400,256
2Mar 30, 2026 00:1310,115109,484,12479,944,0002,997,0002,326,528
3Mar 30, 2026 00:1310,118118,842,84480,970,0001,999,0002,498,560