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 20, 2026 04:43olliecrowolliecrowScore: 131,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:4311,356111,966,26791,118,0002,002,0002,420,736
2Mar 20, 2026 04:43131,6611,111,059,9341,076,623,0002,998,0002,416,640
3Mar 20, 2026 04:43132,3541,115,250,7581,082,308,0002,998,0002,510,848