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 21:51zielajzielajScore: 7,174Success
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 21:516,97181,639,52145,131,00012,034,0002,379,776
2Oct 13, 2024 21:517,06380,657,68243,936,00013,979,0002,404,352
3Oct 13, 2024 21:517,17083,927,87846,834,00011,957,0002,400,256
4Oct 13, 2024 21:517,17384,973,61141,873,00016,948,0002,404,352
5Oct 13, 2024 21:517,17487,582,14845,862,00012,961,0002,375,680
6Oct 13, 2024 21:517,35285,919,63247,222,00013,061,0002,519,040
7Oct 13, 2024 21:517,39486,031,76950,529,00010,105,0002,420,736
8Oct 13, 2024 21:517,459102,829,98749,131,00012,032,0002,310,144
9Oct 13, 2024 21:517,58589,031,96748,156,00014,045,0002,408,448