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 25, 2026 15:49Zhou180Zhou180Score: 14,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:4913,557120,379,73794,380,00016,792,0002,117,632
2Jun 25, 2026 15:4913,602120,754,11793,409,00018,133,0002,117,632
3Jun 25, 2026 15:4913,734121,716,15694,023,00018,597,0002,117,632
4Jun 25, 2026 15:4914,087124,692,07397,798,00017,722,0002,117,632
5Jun 25, 2026 15:4914,118125,015,34897,186,00018,583,0002,117,632
6Jun 25, 2026 15:4914,143125,158,45898,666,00017,309,0002,117,632
7Jun 25, 2026 15:4914,285126,375,30399,563,00017,578,0002,117,632
8Jun 25, 2026 15:4914,521128,298,935101,094,00017,983,0002,117,632
9Jun 25, 2026 15:4914,612129,013,862101,743,00018,076,0002,117,632