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 29, 2026 08:34Victor MerckléVictor MerckléScore: 30,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 08:3730,705259,997,261249,649,0002,139,0002,117,632stderr
2Aug 29, 2026 08:3730,740260,475,886250,914,0001,161,0002,117,632stderr
3Aug 29, 2026 08:3730,747260,532,908251,026,0001,103,0002,117,632stderr
4Aug 29, 2026 08:3730,750260,551,302251,060,0001,096,0002,117,632stderr
5Aug 29, 2026 08:3730,774260,776,851250,287,0002,060,0002,117,632stderr
6Aug 29, 2026 08:3730,948272,774,442252,568,0001,209,0002,117,632stderr
7Aug 29, 2026 08:3730,955262,257,746252,573,0001,262,0002,117,632stderr
8Aug 29, 2026 08:3733,227280,794,503271,395,0001,071,0002,117,632stderr
9Aug 29, 2026 08:3733,661284,476,484274,021,0002,006,0002,117,632stderr