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 25, 2026 07:05olliecrowolliecrowScore: 44,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 07:0712,402109,894,14599,703,0001,994,0002,576,384
2Apr 25, 2026 07:0712,460109,599,22697,172,0005,008,0002,408,448
3Apr 25, 2026 07:0712,543110,234,65699,835,0003,025,0002,531,328
4Apr 25, 2026 07:0744,032369,740,392358,065,0003,000,0002,424,832
5Apr 25, 2026 07:0744,185369,912,297357,333,0004,990,0002,408,448
6Apr 25, 2026 07:0744,187371,168,600357,349,0004,990,0002,580,480
7Apr 25, 2026 07:0744,228371,396,331359,674,0002,997,0002,420,736
8Apr 25, 2026 07:0744,312379,986,300357,371,0005,989,0002,424,832
9Apr 25, 2026 07:0744,465373,288,039360,618,0003,995,0002,502,656