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 listJul 4, 2026 05:43Victor MerckléVictor MerckléScore: 12,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:443,10533,386,31724,335,0001,130,0002,117,632stderr
2Jul 4, 2026 05:443,15533,790,00924,859,0001,018,0002,117,632stderr
3Jul 4, 2026 05:443,15634,151,04524,798,0001,086,0002,117,632stderr
4Jul 4, 2026 05:443,17034,201,18524,941,0001,060,0002,117,632stderr
5Jul 4, 2026 05:4412,159107,627,63398,662,0001,047,0002,117,632stderr
6Jul 4, 2026 05:4412,200108,009,12299,010,0001,036,0002,117,632stderr
7Jul 4, 2026 05:4412,235108,392,33799,150,0001,181,0002,117,632stderr
8Jul 4, 2026 05:4412,240108,359,62099,324,0001,050,0002,117,632stderr
9Jul 4, 2026 05:4412,446110,018,063100,897,0001,164,0002,117,632stderr