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 listApr 24, 2025 14:27Emanuele BolognesiEmanuele BolognesiScore: 42,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 14:2741,154362,440,275240,619,00096,846,0002,387,968
2Apr 24, 2025 14:2742,179372,841,242226,915,000118,955,0002,392,064
3Apr 24, 2025 14:2742,908375,235,570227,898,000123,944,0002,490,368