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 4, 2026 06:20Josu San MartinJosu San MartinScore: 14,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:2113,495120,640,523109,592,0001,074,0002,150,400stderr
2Sep 4, 2026 06:2114,078125,391,280114,362,0001,081,0002,150,400stderr
3Sep 4, 2026 06:2114,092125,494,579114,473,0001,087,0002,150,400stderr
4Sep 4, 2026 06:2114,101125,601,859114,553,0001,082,0002,150,400stderr
5Sep 4, 2026 06:2114,132125,854,440114,799,0001,084,0002,150,400stderr
6Sep 4, 2026 06:2114,146125,958,194114,916,0001,083,0002,150,400stderr
7Sep 4, 2026 06:2124,864213,813,806202,805,0001,084,0002,150,400stderr
8Sep 4, 2026 06:2125,023215,132,627204,115,0001,078,0002,150,400stderr
9Sep 4, 2026 06:2125,479218,963,404207,894,0001,035,0002,150,400stderr