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 listSep 19, 2026 15:27Andrew EpsteinAndrew EpsteinScore: 2,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:282,92633,112,02522,791,0001,204,00020,480
2Sep 19, 2026 15:282,94032,870,94522,953,0001,162,00020,480
3Sep 19, 2026 15:282,96333,198,95423,265,0001,039,00020,480
4Sep 19, 2026 15:282,96933,127,52223,291,0001,058,00020,480
5Sep 19, 2026 15:282,97133,297,57423,336,0001,033,00020,480
6Sep 19, 2026 15:282,97733,907,23923,399,0001,018,00020,480
7Sep 19, 2026 15:282,97833,243,48823,391,0001,035,00020,480
8Sep 19, 2026 15:282,99633,382,66823,544,0001,031,00020,480
9Sep 19, 2026 15:283,01734,111,50123,700,0001,041,00020,480