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 listJul 13, 2023 09:09gchebanovgchebanovScore: 1,085,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 09:091,076,9908,890,005,7468,831,320,05502,289,664
2Jul 13, 2023 09:091,085,7608,973,435,4688,903,233,13802,289,664
3Jul 13, 2023 09:091,090,1269,010,781,1328,939,032,38002,293,760