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 listSep 1, 2026 13:12Victor MerckléVictor MerckléScore: 2,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 13:132,63429,970,35720,544,0001,056,0002,117,632stderr
2Sep 1, 2026 13:132,64130,031,18320,596,0001,063,0002,117,632stderr
3Sep 1, 2026 13:132,64830,122,41420,626,0001,093,0002,117,632stderr
4Sep 1, 2026 13:132,64930,109,78120,700,0001,023,0002,117,632stderr
5Sep 1, 2026 13:132,65230,833,24820,732,0001,015,0002,117,632stderr
6Sep 1, 2026 13:132,66030,211,36020,790,0001,028,0002,117,632stderr
7Sep 1, 2026 13:132,66630,245,03820,834,0001,035,0002,117,632stderr
8Sep 1, 2026 13:135,32352,084,11042,386,0001,267,0002,117,632stderr
9Sep 1, 2026 13:135,35052,299,63742,578,0001,292,0002,117,632stderr