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 listJan 13, 2026 00:10Josu San MartinJosu San MartinScore: 70,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:1070,06257,092,65424,926,000997,0002,363,392
2Jan 13, 2026 00:1070,13551,882,25123,954,0001,996,0002,289,664
3Jan 13, 2026 00:1070,52460,939,43024,087,0002,007,0002,351,104