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 23:35anboto1anboto1Score: 10,991Success
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 23:3710,913369,531,928347,537,00012,595,0002,117,632
2Jun 7, 2026 23:3710,960370,971,541349,694,00012,004,0002,117,632
3Jun 7, 2026 23:3710,981371,709,094349,725,00012,648,0002,117,632
4Jun 7, 2026 23:3710,983371,692,115349,855,00012,585,0002,117,632
5Jun 7, 2026 23:3710,991372,076,116350,063,00012,649,0002,117,632
6Jun 7, 2026 23:3711,014375,103,551351,405,00012,080,0002,117,632
7Jun 7, 2026 23:3711,018372,927,411350,927,00012,676,0002,117,632
8Jun 7, 2026 23:3711,047373,900,893351,911,00012,668,0002,117,632
9Jun 7, 2026 23:3711,124376,357,164354,382,00012,720,0002,117,632