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 18, 2026 07:11Josu San MartinJosu San MartinScore: 5,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 07:155,09350,086,69538,297,0003,469,0002,129,920
2Aug 18, 2026 07:155,09550,260,78938,655,0003,130,0002,129,920
3Aug 18, 2026 07:155,10250,141,31438,364,0003,476,0002,129,920
4Aug 18, 2026 07:155,10450,282,44838,774,0003,084,0002,129,920
5Aug 18, 2026 07:155,12250,566,82138,921,0003,082,0002,125,824
6Aug 18, 2026 07:155,32566,435,20439,164,0004,501,0002,125,824
7Aug 18, 2026 07:1513,114116,061,565103,495,0004,044,0002,125,824
8Aug 18, 2026 07:1513,125117,356,759104,568,0003,060,0002,129,920
9Aug 18, 2026 07:1513,182119,482,807104,049,0004,045,0002,129,920