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 14, 2023 14:18Paul MasurelPaul MasurelScore: 20,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2023 14:195,677130,287,49546,553,97202,191,360
2Jul 14, 2023 14:195,692118,216,77246,672,56302,203,648
3Jul 14, 2023 14:1920,292238,542,978166,394,40902,289,664
4Jul 14, 2023 14:1920,301234,588,325166,465,82802,252,800
5Jul 14, 2023 14:1920,371243,511,321167,038,26902,195,456
6Jul 14, 2023 14:1820,397239,499,123167,257,86402,252,800
7Jul 14, 2023 14:1820,400232,107,803167,280,31802,301,952
8Jul 14, 2023 14:1920,446236,273,188167,657,06402,211,840
9Jul 14, 2023 14:1820,480228,645,993167,934,25002,228,224