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 15, 2026 06:02Tomislav TunkovicTomislav TunkovicScore: 2,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:032,66730,346,49420,748,0001,122,0002,113,536
2Aug 15, 2026 06:032,67630,463,24220,925,0001,021,0002,113,536
3Aug 15, 2026 06:032,67730,455,31120,822,0001,136,0002,113,536
4Aug 15, 2026 06:032,68030,465,61920,863,0001,118,0002,113,536
5Aug 15, 2026 06:032,68130,575,27520,848,0001,144,0002,113,536
6Aug 15, 2026 06:032,68930,600,41720,937,0001,118,0002,113,536
7Aug 15, 2026 06:035,36152,490,32742,871,0001,091,0002,113,536
8Aug 15, 2026 06:035,40352,799,89343,234,0001,078,0002,113,536
9Aug 15, 2026 06:035,42253,457,53643,363,0001,099,0002,113,536