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 listDec 26, 2025 03:18Josu San MartinJosu San MartinScore: 29,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:1829,105264,414,952237,663,000998,0002,387,968
2Dec 26, 2025 03:1829,199268,836,283237,428,0002,003,0002,351,104
3Dec 26, 2025 03:1829,582269,773,999240,574,0001,996,0002,387,968