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:47Oleg KovalovOleg KovalovScore: 57,125Success
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:4754,278472,410,672261,047,000184,033,0002,383,872
2Jan 22, 2025 22:4754,840473,145,756267,812,000181,872,0002,416,640
3Jan 22, 2025 22:4755,987485,259,576260,054,000199,042,0002,277,376
4Jan 22, 2025 22:4756,506490,351,970281,604,000181,744,0002,301,952
5Jan 22, 2025 22:4757,125494,651,409281,653,000186,769,0002,306,048
6Jan 22, 2025 22:4757,750508,694,448278,737,000194,816,0002,400,256
7Jan 22, 2025 22:4761,692537,338,079306,923,000198,950,0002,306,048
8Jan 22, 2025 22:4763,716545,365,862329,669,000192,806,0002,306,048
9Jan 22, 2025 22:4766,728575,941,301363,447,000183,720,0002,281,472