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 18, 2026 04:35limanjun99limanjun99Score: 103,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:35103,019871,985,341714,948,000129,809,0002,297,856
2Mar 18, 2026 04:35103,045884,213,123721,124,000123,849,0002,322,432
3Mar 18, 2026 04:35103,824880,282,707729,447,000121,907,0002,285,568