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:01Zhou180Zhou180Score: 3,945Success
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:023,85440,746,29029,404,0002,205,0002,117,632
2Jun 26, 2026 07:023,87240,952,65229,573,0002,181,0002,117,632
3Jun 26, 2026 07:023,90841,102,19929,802,0002,248,0002,117,632
4Jun 26, 2026 07:023,93641,462,93630,062,0002,219,0002,117,632
5Jun 26, 2026 07:023,94541,470,29230,158,0002,194,0002,117,632
6Jun 26, 2026 07:023,96942,150,44930,293,0002,257,0002,117,632
7Jun 26, 2026 07:023,99842,369,51130,485,0002,300,0002,117,632
8Jun 26, 2026 07:024,07842,631,57131,282,0002,163,0002,117,632
9Jun 26, 2026 07:0222,468193,374,994180,851,0003,387,0002,117,632