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 01:39anboto1anboto1Score: 10,955Success
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 01:4010,844367,720,410345,853,00012,001,0002,117,632
2Jun 8, 2026 01:4010,884368,433,468346,874,00012,320,0002,117,632
3Jun 8, 2026 01:4010,907369,679,637347,976,00011,987,0002,117,632
4Jun 8, 2026 01:4010,925369,811,406347,773,00012,758,0002,117,632
5Jun 8, 2026 01:4010,955370,885,116348,797,00012,742,0002,117,632
6Jun 8, 2026 01:4010,956370,940,579349,575,00011,991,0002,117,632
7Jun 8, 2026 01:4011,034373,329,398351,327,00012,797,0002,117,632
8Jun 8, 2026 01:4011,050374,016,470352,333,00012,325,0002,117,632
9Jun 8, 2026 01:4011,157377,390,449355,998,00012,185,0002,117,632