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 29, 2026 00:42Dominique GarmierDominique GarmierScore: 26,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 00:4214,225141,799,682114,621,0002,028,0002,396,160
2Mar 29, 2026 00:4226,434254,401,305214,762,0001,997,0002,383,872
3Mar 29, 2026 00:4226,581244,336,879212,968,0004,999,0002,482,176