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 listOct 13, 2024 00:56zielajzielajScore: 35,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 00:5634,522308,707,318259,074,00024,006,0002,469,888
2Oct 13, 2024 00:5634,708309,820,931247,660,00036,949,0002,297,856
3Oct 13, 2024 00:5635,079317,676,786267,675,00019,975,0002,289,664
4Oct 13, 2024 00:5635,150315,049,979267,213,00021,016,0002,433,024
5Oct 13, 2024 00:5635,256314,709,582262,090,00027,009,0002,420,736
6Oct 13, 2024 00:5635,558318,351,217264,612,00026,960,0002,531,328
7Oct 13, 2024 00:5635,570317,381,401270,702,00020,976,0002,363,392
8Oct 13, 2024 00:5636,888329,449,043289,507,00012,977,0002,428,928
9Oct 13, 2024 00:5637,068332,706,544279,962,00023,996,0002,424,832