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 08:48Zhou180Zhou180Score: 22,066Success
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 08:503,45437,423,96827,290,0001,033,0002,117,632
2Jun 26, 2026 08:503,45737,494,60627,284,0001,066,0002,117,632
3Jun 26, 2026 08:5021,807187,932,121176,812,0002,010,0002,117,632
4Jun 26, 2026 08:5021,889188,635,280177,479,0002,012,0002,117,632
5Jun 26, 2026 08:5022,066190,076,428178,933,0002,015,0002,117,632
6Jun 26, 2026 08:5022,086190,299,876178,079,0003,029,0002,117,632
7Jun 26, 2026 08:5022,096190,364,754179,178,0002,011,0002,117,632
8Jun 26, 2026 08:5022,356192,481,687180,271,0003,052,0002,117,632
9Jun 26, 2026 08:5022,534193,947,563182,773,0002,011,0002,117,632