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 listNov 4, 2025 22:07AntonAntonScore: 31,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 22:0730,942288,869,847251,724,0001,997,0002,560,000
2Nov 4, 2025 22:0731,007285,104,530252,253,0002,002,0002,297,856
3Nov 4, 2025 22:0731,086280,610,943252,903,0001,999,0002,306,048
4Nov 4, 2025 22:0731,222289,154,567254,019,0002,000,0002,519,040
5Nov 4, 2025 22:0731,769287,386,863259,507,0001,001,0002,301,952
6Nov 4, 2025 22:0731,831284,486,969259,018,0002,000,0002,551,808
7Nov 4, 2025 22:0732,281289,702,830261,708,0002,996,0002,297,856
8Nov 4, 2025 22:0733,423302,012,850272,067,0002,000,0002,555,904
9Nov 4, 2025 22:0734,105309,000,065276,664,0002,996,0002,297,856