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 12, 2026 22:46Adam FolwarcznyAdam FolwarcznyScore: 33,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:4632,9781,117,535,0321,076,274,00011,991,0002,465,792
2Jan 12, 2026 22:4633,1201,118,832,4081,078,981,00013,986,0002,465,792
3Jan 12, 2026 22:4633,2241,120,549,2091,081,417,00014,991,0002,465,792