Unique strings Sergey Svistunov

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 17, 2026 06:34marko1597marko1597Score: 7,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 06:377,578258,413,535243,803,0006,292,0002,121,728stderr
2Aug 17, 2026 06:377,586258,707,093243,992,0006,374,0002,121,728stderr
3Aug 17, 2026 06:377,599259,035,585244,408,0006,372,0002,121,728stderr
4Aug 17, 2026 06:377,604259,106,117244,732,0006,208,0002,121,728stderr
5Aug 17, 2026 06:377,613259,488,236244,827,0006,425,0002,121,728stderr
6Aug 17, 2026 06:377,625259,971,581245,205,0006,422,0002,121,728stderr
7Aug 17, 2026 06:377,650262,358,760245,937,0006,526,0002,121,728stderr
8Aug 17, 2026 06:377,710262,754,441247,978,0006,476,0002,121,728stderr
9Aug 17, 2026 06:377,777264,975,953250,237,0006,411,0002,121,728stderr