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 listJan 13, 2026 22:49Adam FolwarcznyAdam FolwarcznyScore: 17,436Success
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 22:4917,296599,715,280562,772,0007,996,0002,277,376
2Jan 13, 2026 22:4917,436601,535,380564,410,00010,988,0002,428,928
3Jan 13, 2026 22:4918,144622,631,072590,760,0007,996,0002,277,376