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 8, 2026 16:24anboto1anboto1Score: 5,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 16:255,598194,503,864173,422,00011,339,0002,117,632
2Jun 8, 2026 16:255,608194,350,719173,764,00011,325,0002,117,632
3Jun 8, 2026 16:255,623194,770,924173,699,00011,862,0002,117,632
4Jun 8, 2026 16:255,624195,420,100174,320,00011,297,0002,117,632
5Jun 8, 2026 16:255,626194,869,588174,304,00011,361,0002,117,632
6Jun 8, 2026 16:255,641195,443,615174,956,00011,207,0002,117,632
7Jun 8, 2026 16:255,705197,559,740176,227,00012,055,0002,117,632
8Jun 8, 2026 16:255,715198,248,689177,169,00011,456,0002,117,632
9Jun 8, 2026 16:255,720197,995,710177,315,00011,459,0002,117,632