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 16, 2026 06:42olliecrowolliecrowScore: 60,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 06:4260,86545,734,14721,497,0001,023,0002,383,872
2Apr 16, 2026 06:4260,95145,387,85322,552,00002,383,872
3Apr 16, 2026 06:4261,05451,305,91921,564,0001,026,0002,289,664