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 listDec 22, 2025 19:12zielajzielajScore: 4,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 19:124,493172,691,323131,231,00017,030,0002,297,856
2Dec 22, 2025 19:124,496171,213,369135,335,00013,032,0002,318,336
3Dec 22, 2025 19:124,521169,063,606136,183,00013,017,0002,437,120
4Dec 22, 2025 19:124,537176,563,129136,742,00012,975,0002,355,200
5Dec 22, 2025 19:124,558179,681,376142,377,0008,021,0002,322,432
6Dec 22, 2025 19:124,572172,313,664138,891,00011,990,0002,400,256
7Dec 22, 2025 19:124,582171,358,619138,184,00013,017,0002,342,912
8Dec 22, 2025 19:124,584174,179,221142,243,0009,015,0002,469,888
9Dec 22, 2025 19:124,737180,760,027148,297,0008,016,0002,318,336