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 14, 2026 21:00Adam FolwarcznyAdam FolwarcznyScore: 18,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2026 21:0018,155626,557,445590,103,0009,001,0002,392,064
2Jan 14, 2026 21:0018,254629,492,806593,382,0008,990,0002,461,696
3Jan 14, 2026 21:0018,313625,235,839593,348,00010,987,0002,273,280