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 01:00Paul MasurelPaul MasurelScore: 18,235Success
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 00:5918,050204,125,795148,008,88302,265,088
2Jul 14, 2023 00:5918,086207,611,122148,304,09302,228,224
3Jul 14, 2023 01:0018,184213,323,738149,107,23202,215,936
4Jul 14, 2023 01:0018,235212,293,339149,525,32202,293,760
5Jul 14, 2023 01:0018,332216,130,359150,324,42902,203,648
6Jul 14, 2023 00:5918,833222,509,252154,430,35702,297,856