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 21:52anboto1anboto1Score: 11,631Success
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 21:5611,436387,083,783365,642,00011,776,0002,117,632
2Jun 7, 2026 21:5611,487388,326,191367,272,00011,816,0002,117,632
3Jun 7, 2026 21:5611,519389,403,631368,271,00011,863,0002,117,632
4Jun 7, 2026 21:5611,535390,045,099368,775,00011,886,0002,117,632
5Jun 7, 2026 21:5611,631393,129,296371,311,00012,539,0002,117,632
6Jun 7, 2026 21:5611,666395,922,027372,469,00012,514,0002,117,632
7Jun 7, 2026 21:5611,673394,525,730372,609,00012,630,0002,117,632
8Jun 7, 2026 21:5611,704395,720,367373,648,00012,611,0002,117,632
9Jun 7, 2026 21:5611,782398,152,250376,387,00012,432,0002,117,632