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 12, 2024 07:10E SequeiraE SequeiraScore: 111,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 07:1081,835700,595,593559,041,000112,008,0002,523,136
2Nov 12, 2024 07:1093,925800,251,830666,163,000104,025,0002,412,544
3Nov 12, 2024 07:10106,015895,334,627748,415,000120,905,0002,396,160
4Nov 12, 2024 07:10111,050935,035,531782,666,000127,945,0002,445,312
5Nov 12, 2024 07:10111,711949,094,294800,028,000116,004,0002,310,144
6Nov 12, 2024 07:10113,355950,716,267816,567,000112,940,0002,510,848
7Nov 12, 2024 07:10114,131961,654,332822,891,000112,985,0002,437,120
8Nov 12, 2024 07:10115,921974,656,427817,614,000132,937,0002,527,232
9Nov 12, 2024 07:10121,6811,019,929,847875,810,000121,973,0002,510,848