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 26, 2026 19:09Dominique GarmierDominique GarmierScore: 71,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:0970,76257,354,29924,168,0002,014,0002,277,376
2Mar 26, 2026 19:0971,02453,235,29224,258,0002,021,0002,293,760
3Mar 26, 2026 19:0971,55449,340,92525,457,0001,018,0002,277,376