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 17, 2026 10:55Tomislav TunkovicTomislav TunkovicScore: 2,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 10:592,93835,297,40122,959,0001,140,0002,129,920
2Aug 17, 2026 10:592,95233,961,38923,089,0001,124,0002,129,920
3Aug 17, 2026 10:592,95234,311,83223,103,0001,111,0002,129,920
4Aug 17, 2026 10:592,95534,021,79523,125,0001,111,0002,129,920
5Aug 17, 2026 10:592,97134,207,25823,250,0001,117,0002,129,920
6Aug 17, 2026 10:592,99134,301,53122,422,0002,105,0002,174,976
7Aug 17, 2026 10:596,78665,369,06553,545,0002,106,0002,129,920
8Aug 17, 2026 10:596,90076,377,61654,391,0002,190,0002,129,920
9Aug 17, 2026 10:5911,045100,648,08188,510,0002,064,0002,174,976