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 14:31Charles CabergsCharles CabergsScore: 72,748Success
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 14:3272,62943,788,45624,883,0001,990,0002,363,392
2Apr 28, 2026 14:3272,63546,272,68123,889,0002,986,0002,301,952
3Apr 28, 2026 14:3272,68348,989,00224,901,0001,992,0002,363,392
4Apr 28, 2026 14:3272,68939,666,51623,907,0002,988,0002,555,904
5Apr 28, 2026 14:3272,74850,685,98623,927,0002,990,0002,359,296
6Apr 28, 2026 14:3272,80246,517,07124,942,0001,995,0002,297,856
7Apr 28, 2026 14:3273,07044,904,05324,032,0003,004,0002,363,392
8Apr 28, 2026 14:3273,12144,191,45323,047,0004,008,0002,359,296
9Apr 28, 2026 14:3273,18146,950,94025,072,0002,005,0002,359,296