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 listMay 7, 2024 13:04dpetruciidpetruciiScore: 1,830,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 13:041,784,96814,710,034,95114,636,737,67402,220,032
2May 7, 2024 13:041,830,21615,076,242,49615,007,769,37402,224,128
3May 7, 2024 13:041,850,41815,228,895,79915,173,429,84602,220,032