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 27, 2026 22:31TudyMTudyMScore: 24,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:3924,592219,126,564198,665,0002,994,0002,445,312
2Apr 27, 2026 22:3924,621224,886,804196,903,0004,997,0002,400,256
3Apr 27, 2026 22:3924,632216,749,566194,984,0006,999,0002,355,200
4Apr 27, 2026 22:3924,646219,551,404198,103,0004,002,0002,514,944
5Apr 27, 2026 22:3924,700216,919,522201,544,0001,002,0002,297,856
6Apr 27, 2026 22:3924,769218,671,276201,108,0002,001,0002,347,008
7Apr 27, 2026 22:3924,816219,133,853198,484,0005,012,0002,510,848
8Apr 27, 2026 22:3924,885224,028,878202,062,0002,000,0002,363,392
9Apr 27, 2026 22:3924,905228,307,435202,224,0002,002,0002,355,200