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 listApr 28, 2026 01:22Charles CabergsCharles CabergsScore: 72,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 01:2372,50847,351,12922,854,0003,974,0002,363,392
2Apr 28, 2026 01:2372,54850,019,50423,861,0002,982,0002,347,008
3Apr 28, 2026 01:2372,61046,166,31324,876,0001,990,0002,301,952
4Apr 28, 2026 01:2372,61846,117,89123,884,0002,985,0002,359,296
5Apr 28, 2026 01:2372,66448,406,30322,903,0003,983,0002,363,392
6Apr 28, 2026 01:2372,69144,458,34224,904,0001,992,0002,359,296
7Apr 28, 2026 01:2372,90544,804,21023,978,0002,997,0002,359,296
8Apr 28, 2026 01:2372,94846,049,04924,992,0001,999,0002,310,144
9Apr 28, 2026 01:2373,00545,668,75625,012,0002,000,0002,297,856