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 18:47Josu San MartinJosu San MartinScore: 3,255Success
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 18:473,21337,587,32725,163,0001,189,0002,117,632
2Sep 3, 2026 18:473,21536,355,46525,167,0001,203,0002,117,632
3Sep 3, 2026 18:473,21736,363,42325,182,0001,199,0002,117,632
4Sep 3, 2026 18:473,25436,630,80525,393,0001,291,0002,117,632
5Sep 3, 2026 18:473,25537,147,79325,410,0001,285,0002,117,632
6Sep 3, 2026 18:473,28837,775,81925,934,0001,030,0002,117,632
7Sep 3, 2026 18:473,30248,625,95626,018,0001,061,0002,121,728
8Sep 3, 2026 18:473,30937,140,63526,114,0001,023,0002,117,632
9Sep 3, 2026 18:4715,458136,763,904125,757,0001,004,0002,117,632