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 20, 2026 20:02Pavel SkripkinPavel SkripkinScore: 25,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 20:0224,945845,667,463714,292,000108,892,0002,363,392
2Jan 20, 2026 20:0225,458864,024,693734,238,000105,890,0002,445,312
3Jan 20, 2026 20:0228,465962,762,975831,421,000107,924,0002,289,664