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 15, 2023 14:29Paul MasurelPaul MasurelScore: 50,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 14:2950,173485,609,991411,418,77002,248,704
2Jul 15, 2023 14:2950,174473,875,454411,427,00702,224,128
3Jul 15, 2023 14:2950,197479,520,147411,615,53602,285,568