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 listApr 15, 2026 01:56zielajzielajScore: 2,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 01:592,82047,778,36522,115,0001,005,0002,478,080
2Apr 15, 2026 01:592,83448,157,20621,219,0002,020,0002,506,752
3Apr 15, 2026 01:592,83747,113,85621,242,0002,023,0002,502,656
4Apr 15, 2026 01:562,83845,564,99522,261,0001,011,0002,347,008
5Apr 15, 2026 01:592,83844,642,84522,261,0001,011,0002,342,912
6Apr 15, 2026 01:592,84243,851,82021,281,0002,026,0002,486,272
7Apr 15, 2026 01:562,84350,470,55522,303,0001,013,0002,486,272
8Apr 15, 2026 01:592,85644,506,83923,422,00002,498,560
9Apr 15, 2026 01:595,36270,481,71139,971,0003,997,0002,396,160
10Apr 15, 2026 01:565,39470,632,40743,226,0001,005,0002,408,448
11Apr 15, 2026 01:595,42577,147,35141,450,0003,032,0002,289,664
12Apr 15, 2026 01:595,43671,965,41542,548,0002,026,0002,297,856