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 25, 2026 15:41Dominique GarmierDominique GarmierScore: 73,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 15:4173,898626,195,858604,965,000999,0002,531,328
2Mar 25, 2026 15:4173,916634,826,948604,114,0001,997,0002,457,600
3Mar 25, 2026 15:4174,024630,321,430604,998,0001,996,0002,461,696