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 24, 2026 10:45anboto1anboto1Score: 5,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:465,478189,999,764171,552,0009,250,0002,117,632
2Jun 24, 2026 10:465,478191,784,141171,426,0009,348,0002,117,632
3Jun 24, 2026 10:465,489190,385,803171,705,0009,435,0002,117,632
4Jun 24, 2026 10:465,494190,953,497171,981,0009,331,0002,117,632
5Jun 24, 2026 10:465,497190,644,252172,073,0009,358,0002,117,632
6Jun 24, 2026 10:465,506191,485,638172,222,0009,488,0002,117,632
7Jun 24, 2026 10:465,556193,064,147173,931,0009,418,0002,117,632
8Jun 24, 2026 10:465,565193,470,109174,254,0009,423,0002,117,632
9Jun 24, 2026 10:465,574193,227,186174,475,0009,468,0002,117,632