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 19:24Dominique GarmierDominique GarmierScore: 20,192Success
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 19:2420,154192,514,267164,259,0001,001,0002,392,064
2Mar 22, 2026 19:2420,192192,773,242163,569,0002,006,0002,310,144
3Mar 22, 2026 19:2420,206198,650,107161,698,0003,992,0002,371,584