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:26anboto1anboto1Score: 11,099Success
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:2911,016373,097,530351,576,00011,972,0002,117,632
2Jun 7, 2026 23:2911,022373,457,304351,735,00011,995,0002,117,632
3Jun 7, 2026 23:2911,036373,869,009352,231,00011,986,0002,117,632
4Jun 7, 2026 23:2911,048374,275,854352,542,00012,064,0002,117,632
5Jun 7, 2026 23:2911,099375,544,435353,538,00012,755,0002,117,632
6Jun 7, 2026 23:2911,111376,462,382354,539,00012,127,0002,117,632
7Jun 7, 2026 23:2911,163377,727,444356,081,00012,301,0002,117,632
8Jun 7, 2026 23:2911,218379,476,615358,231,00011,991,0002,117,632
9Jun 7, 2026 23:2911,300382,161,749360,758,00012,169,0002,117,632