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 listNov 17, 2024 12:55Dan StolyarovDan StolyarovScore: 975,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 12:55967,1927,968,913,7157,725,134,000205,843,0002,281,472
2Nov 17, 2024 12:55970,6437,992,810,6747,767,413,000191,862,0002,281,472
3Nov 17, 2024 12:55972,2788,006,590,1007,769,844,000202,839,0002,428,928
4Nov 17, 2024 12:55972,7258,006,078,6407,780,480,000195,861,0002,281,472
5Nov 17, 2024 12:55975,0168,027,328,3367,792,281,000202,851,0002,281,472
6Nov 17, 2024 12:55975,5518,037,335,8327,800,683,000198,838,0002,281,472
7Nov 17, 2024 12:55975,6688,036,225,0507,789,651,000210,828,0002,281,472
8Nov 17, 2024 12:55976,7498,039,846,5067,804,489,000204,855,0002,281,472
9Nov 17, 2024 12:55978,6058,061,400,3327,809,710,000214,854,0002,461,696