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 20:27anboto1anboto1Score: 13,052Success
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 20:2812,777431,415,006409,042,00012,611,0002,117,632
2Jun 7, 2026 20:2812,779431,125,135409,067,00012,660,0002,117,632
3Jun 7, 2026 20:2812,791431,688,702409,151,00012,954,0002,117,632
4Jun 7, 2026 20:2812,811434,579,301409,829,00012,961,0002,117,632
5Jun 7, 2026 20:2813,052440,103,929417,321,00013,395,0002,117,632
6Jun 7, 2026 20:2813,111442,002,722419,328,00013,337,0002,117,632
7Jun 7, 2026 20:2813,112441,991,857419,316,00013,399,0002,117,632
8Jun 7, 2026 20:2813,166444,140,073421,055,00013,451,0002,117,632
9Jun 7, 2026 20:2813,168444,264,368421,140,00013,408,0002,117,632