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 listAug 14, 2026 17:50marko1597marko1597Score: 5,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:515,54553,734,26243,379,0002,093,0002,117,632
2Aug 14, 2026 17:515,56553,867,51943,513,0002,128,0002,117,632
3Aug 14, 2026 17:515,59954,367,28743,783,0002,136,0002,117,632
4Aug 14, 2026 17:515,61154,518,24743,870,0002,148,0002,117,632
5Aug 14, 2026 17:515,86656,537,90346,060,0002,042,0002,117,632
6Aug 14, 2026 17:516,00057,400,96247,159,0002,048,0002,117,632
7Aug 14, 2026 17:5130,890261,683,316252,298,0001,004,0002,117,632
8Aug 14, 2026 17:5130,968263,751,689252,939,0001,004,0002,117,632
9Aug 14, 2026 17:5132,432274,920,049264,943,0001,002,0002,117,632