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 3, 2026 04:34Josu San MartinJosu San MartinScore: 11,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:353,37037,860,04226,603,0001,037,0002,117,632
2Sep 3, 2026 04:353,37538,321,27826,603,0001,073,0002,117,632
3Sep 3, 2026 04:353,41837,939,90626,973,0001,058,0002,117,632
4Sep 3, 2026 04:3511,437103,698,04991,761,0002,026,0002,117,632
5Sep 3, 2026 04:3511,438104,330,62591,764,0002,030,0002,117,632
6Sep 3, 2026 04:3511,446103,792,48191,830,0002,028,0002,117,632
7Sep 3, 2026 04:3511,454106,156,71591,834,0002,090,0002,117,632
8Sep 3, 2026 04:3511,469104,908,01691,991,0002,059,0002,117,632
9Sep 3, 2026 04:3511,622105,248,00993,296,0002,011,0002,117,632