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 22:00Adam FolwarcznyAdam FolwarcznyScore: 18,587Success
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 22:0018,511637,761,185603,861,0006,998,0002,531,328
2Jan 14, 2026 22:0018,587638,989,131604,378,0008,990,0002,510,848
3Jan 14, 2026 22:0018,661636,225,422607,805,0007,997,0002,523,136