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 3, 2026 05:09Rajarshi BasuRajarshi BasuScore: 4,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 05:094,916186,469,426158,235,0004,005,0002,510,848
2Jan 3, 2026 05:104,932187,741,858159,750,0002,995,0002,371,584
3Jan 3, 2026 05:104,952195,524,515159,411,0004,010,0002,514,944
4Jan 3, 2026 05:094,960189,265,366158,681,0004,989,0002,514,944
5Jan 3, 2026 05:094,965187,178,535159,844,0003,996,0002,289,664
6Jan 3, 2026 05:105,042187,032,411162,395,0003,985,0002,297,856