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:32anboto1anboto1Score: 11,103Success
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:3310,963371,167,752349,211,00012,591,0002,117,632
2Jun 7, 2026 23:3311,035374,036,342352,060,00012,104,0002,117,632
3Jun 7, 2026 23:3311,065374,513,112352,798,00012,360,0002,117,632
4Jun 7, 2026 23:3311,091375,213,979353,283,00012,727,0002,117,632
5Jun 7, 2026 23:3311,103375,720,023353,663,00012,741,0002,117,632
6Jun 7, 2026 23:3311,105375,823,084353,726,00012,761,0002,117,632
7Jun 7, 2026 23:3311,181378,228,271356,241,00012,741,0002,117,632
8Jun 7, 2026 23:3311,213379,310,992357,292,00012,751,0002,117,632
9Jun 7, 2026 23:3311,249380,448,221358,596,00012,642,0002,117,632