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:42anboto1anboto1Score: 11,084Success
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:4411,002372,844,154351,113,00011,981,0002,117,632
2Jun 7, 2026 23:4411,055374,164,901352,215,00012,624,0002,117,632
3Jun 7, 2026 23:4411,064374,361,495352,165,00012,968,0002,117,632
4Jun 7, 2026 23:4411,081375,020,557353,008,00012,681,0002,117,632
5Jun 7, 2026 23:4411,084375,501,989353,814,00011,963,0002,117,632
6Jun 7, 2026 23:4411,115376,174,702354,053,00012,774,0002,117,632
7Jun 7, 2026 23:4411,158377,931,627356,101,00012,116,0002,117,632
8Jun 7, 2026 23:4411,162377,630,125355,745,00012,614,0002,117,632
9Jun 7, 2026 23:4411,203379,424,812357,532,00012,194,0002,117,632