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 listMar 17, 2026 17:52T PrathamT PrathamScore: 43,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 17:5242,804375,938,396347,994,0002,999,0002,519,040
2Mar 17, 2026 17:5243,130378,481,882351,668,0001,998,0002,523,136
3Mar 17, 2026 17:5243,274383,728,269351,850,0002,998,0002,269,184