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 02:56Josu San MartinJosu San MartinScore: 69,222Success
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 02:5668,78648,358,98424,433,0001,018,0002,396,160
2Jan 13, 2026 02:5669,22248,669,36525,612,00002,277,376
3Jan 13, 2026 02:5669,36853,009,25824,640,0001,026,0002,277,376