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 18, 2025 02:07Chandrasekaran AkashChandrasekaran AkashScore: 60,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 02:0760,57849,761,04321,396,0001,018,0002,441,216
2Apr 18, 2025 02:0760,95446,273,42322,553,00002,441,216
3Apr 18, 2025 02:0761,04347,076,31422,586,00002,531,328