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 24, 2026 09:40Dominique GarmierDominique GarmierScore: 13,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 09:4010,605113,212,00085,962,000999,0002,273,280
2Mar 24, 2026 09:4013,220131,249,900104,391,0004,015,0002,322,432
3Mar 24, 2026 09:4013,247138,748,884104,639,0003,986,0002,387,968