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 listJul 15, 2023 14:42Paul MasurelPaul MasurelScore: 58,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 14:423,863103,871,25831,677,05602,207,744
2Jul 15, 2023 14:4257,323523,725,795470,046,04802,297,856
3Jul 15, 2023 14:4357,388537,948,685470,585,12202,215,936
4Jul 15, 2023 14:4258,056554,266,422476,062,69802,314,240
5Jul 15, 2023 14:4358,208539,622,370477,305,40602,265,088
6Jul 15, 2023 14:4258,227545,467,537477,463,35002,306,048
7Jul 15, 2023 14:4258,282547,447,121477,915,19502,220,032
8Jul 15, 2023 14:4358,288554,642,016477,963,53702,289,664
9Jul 15, 2023 14:4258,310547,393,590478,141,35502,310,144