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 listJun 7, 2026 22:28anboto1anboto1Score: 11,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 22:3111,228380,489,677358,556,00011,977,0002,117,632
2Jun 7, 2026 22:3111,240380,738,518358,951,00011,972,0002,117,632
3Jun 7, 2026 22:3111,296382,399,577360,820,00011,953,0002,117,632
4Jun 7, 2026 22:3111,300382,232,870360,886,00012,018,0002,117,632
5Jun 7, 2026 22:3111,367384,466,206363,051,00012,063,0002,117,632
6Jun 7, 2026 22:3111,402386,030,260364,207,00012,082,0002,117,632
7Jun 7, 2026 22:3111,428386,429,906364,338,00012,797,0002,117,632
8Jun 7, 2026 22:3111,439387,063,487365,474,00012,027,0002,117,632
9Jun 7, 2026 22:3111,457387,269,137365,358,00012,733,0002,117,632