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 listJun 26, 2026 08:54Zhou180Zhou180Score: 3,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:573,61138,694,09927,594,0002,018,0002,117,632
2Jun 26, 2026 08:573,61838,775,38828,607,0001,065,0002,117,632
3Jun 26, 2026 08:573,72039,636,13528,430,0002,077,0002,117,632
4Jun 26, 2026 08:573,73040,160,10228,478,0002,114,0002,117,632
5Jun 26, 2026 08:573,73939,798,64228,602,0002,059,0002,117,632
6Jun 26, 2026 08:573,77440,076,92328,807,0002,147,0002,117,632
7Jun 26, 2026 08:5722,167190,881,214178,624,0003,146,0002,117,632
8Jun 26, 2026 08:5722,471193,429,000181,088,0003,176,0002,117,632
9Jun 26, 2026 08:5722,964197,491,303184,952,0003,355,0002,117,632