Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listAug 31, 2026 13:14Victor MerckléVictor MerckléScore: 4,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 13:154,516135,498,404370,321,0003,078,0002,174,976stderr
2Aug 31, 2026 13:154,518135,561,806370,433,0003,060,0002,174,976stderr
3Aug 31, 2026 13:154,543136,308,376371,356,0002,120,0002,174,976stderr
4Aug 31, 2026 13:154,551136,543,049372,604,0003,083,0002,174,976stderr
5Aug 31, 2026 13:154,559136,797,297374,193,0003,128,0002,174,976stderr
6Aug 31, 2026 13:154,559136,778,835374,311,0003,123,0002,174,976stderr
7Aug 31, 2026 13:154,562136,870,658372,017,0002,104,0002,174,976stderr
8Aug 31, 2026 13:154,563136,910,977373,431,0002,113,0002,174,976stderr
9Aug 31, 2026 13:154,582137,486,547375,049,0002,093,0002,174,976stderr