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 22:42Oleg KovalovOleg KovalovScore: 322,969Success
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 22:42321,5162,667,542,6012,434,625,000201,803,0002,281,472
2Jan 22, 2025 22:42322,9692,679,485,8202,455,541,000192,806,0002,330,624
3Jan 22, 2025 22:42329,3112,724,483,4602,508,536,000191,811,0002,498,560