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 listMar 3, 2026 20:24Josu San MartinJosu San MartinScore: 35,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 20:2435,083314,706,032282,686,0004,994,0002,461,696
2Mar 3, 2026 20:2435,235312,310,448286,926,0001,999,0002,494,464
3Mar 3, 2026 20:2436,434326,931,073296,763,0001,998,0002,424,832