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 27, 2026 07:41Dominique GarmierDominique GarmierScore: 77,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 07:4175,121638,850,160534,128,00081,866,0002,293,760
2Mar 27, 2026 07:4177,790668,158,690556,021,00081,855,0002,273,280
3Mar 27, 2026 07:4196,738813,338,706714,326,00078,925,0002,420,736