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 listJun 26, 2026 07:06Zhou180Zhou180Score: 4,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:074,00842,062,73130,793,0002,080,0002,117,632
2Jun 26, 2026 07:074,04142,293,04130,984,0002,154,0002,117,632
3Jun 26, 2026 07:074,08342,675,01631,332,0002,150,0002,117,632
4Jun 26, 2026 07:074,09342,757,41031,379,0002,190,0002,117,632
5Jun 26, 2026 07:074,10642,814,33031,553,0002,118,0002,117,632
6Jun 26, 2026 07:074,11342,925,20731,519,0002,211,0002,117,632
7Jun 26, 2026 07:074,11842,909,64131,521,0002,251,0002,117,632
8Jun 26, 2026 07:0722,350192,471,881180,156,0003,120,0002,117,632
9Jun 26, 2026 07:0723,298200,298,750187,724,0003,324,0002,117,632