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 24, 2026 05:05Dominique GarmierDominique GarmierScore: 636,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 11:14634,938258,830,368232,928,0001,999,0002,326,528
2Mar 24, 2026 05:05635,097257,591,958232,987,0001,999,0002,543,616
3Mar 24, 2026 11:14635,654263,590,356234,192,0001,000,0002,531,328
4Mar 24, 2026 05:05636,262267,430,926235,417,00002,326,528
5Mar 24, 2026 11:14650,257272,145,856238,599,0001,996,0002,326,528
6Mar 24, 2026 05:05653,516267,330,792240,802,000999,0002,547,712