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 listMar 15, 2026 11:17Dominique GarmierDominique GarmierScore: 166,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 11:17166,46295,333,50860,582,0001,009,0002,289,664
2Mar 15, 2026 11:17166,47393,039,03561,595,00002,289,664
3Mar 15, 2026 11:17167,11989,984,31760,837,000997,0002,387,968