TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listApr 28, 2026 13:57Dominique GarmierDominique GarmierScore: 69,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 13:5769,79144,027,11223,837,0001,986,0002,322,432
2Apr 28, 2026 13:5769,88643,275,58023,869,0001,989,0002,383,872
3Apr 28, 2026 13:5769,90841,281,00923,877,0001,989,0002,387,968
4Apr 28, 2026 13:5769,94542,986,87923,890,0001,990,0002,387,968
5Apr 28, 2026 13:5769,99145,855,51123,905,0001,992,0002,387,968
6Apr 28, 2026 13:5770,11842,926,81023,949,0001,995,0002,379,776
7Apr 28, 2026 13:5770,29745,477,57124,970,0001,040,0002,379,776
8Apr 28, 2026 13:5770,38942,712,62324,041,0002,003,0002,387,968
9Apr 28, 2026 13:5770,54544,102,41124,095,0002,007,0002,326,528