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 13:41Emanuele BolognesiEmanuele BolognesiScore: 952,025Success
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 13:41941,9397,754,138,9517,599,983,000123,918,0002,363,392
2Apr 24, 2025 13:41952,0257,840,130,4507,678,674,000127,927,0002,527,232
3Apr 24, 2025 13:411,135,9559,351,188,6049,163,917,000150,916,0002,519,040