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 listFeb 2, 2025 18:50HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 106,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 18:50106,650896,837,211874,534,00002,527,232
2Feb 2, 2025 18:50106,954910,540,709875,029,0001,995,0002,449,408
3Feb 2, 2025 18:50107,473904,349,492881,279,00002,453,504