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 listMay 15, 2026 00:44zielajzielajScore: 5,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:462,68130,079,43120,810,0001,180,0002,117,632stderr
2May 15, 2026 00:462,68632,176,39320,827,0001,204,0002,117,632stderr
3May 15, 2026 00:462,68830,374,37620,897,0001,149,0002,117,632stderr
4May 15, 2026 00:465,13251,083,23441,045,0001,038,0002,117,632stderr
5May 15, 2026 00:465,13651,450,69941,099,0001,020,0002,117,632stderr
6May 15, 2026 00:465,13950,918,27141,112,0001,030,0002,117,632stderr
7May 15, 2026 00:465,14149,453,53641,127,0001,034,0002,117,632stderr
8May 15, 2026 00:465,14650,782,98841,182,0001,020,0002,117,632stderr
9May 15, 2026 00:465,17250,077,56441,369,0001,043,0002,117,632stderr