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 listJan 22, 2025 20:45Oleg KovalovOleg KovalovScore: 973,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 20:45971,8048,001,512,2507,775,917,000192,873,0002,297,856
2Jan 22, 2025 20:45973,7248,017,570,3467,789,692,000194,842,0002,265,088
3Jan 22, 2025 20:45976,4158,038,740,4647,802,769,000203,837,0002,281,472