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 8, 2026 19:28Павел РатмановПавел РатмановScore: 39,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:2839,0521,313,250,9851,278,731,0009,997,0002,330,624
2Jan 8, 2026 19:2839,3501,321,437,3191,286,563,00011,995,0002,441,216
3Jan 8, 2026 19:2839,4141,327,570,0761,288,672,00011,996,0002,306,048
4Jan 8, 2026 19:2839,4291,327,005,8811,290,154,00010,992,0002,330,624
5Jan 8, 2026 19:2839,4811,330,170,7111,293,858,0008,999,0002,273,280
6Jan 8, 2026 19:2839,5801,331,728,1061,295,158,00010,992,0002,506,752
7Jan 8, 2026 19:2839,6061,329,832,0791,293,995,00012,989,0002,420,736
8Jan 8, 2026 19:2839,6351,337,026,3611,298,975,0008,992,0002,273,280
9Jan 8, 2026 19:2839,9241,346,789,1971,306,492,00010,995,0002,445,312