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 00:23anboto1anboto1Score: 10,761Success
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 00:2510,562357,767,216336,797,00011,750,0002,117,632
2Jun 8, 2026 00:2510,690364,643,119341,001,00011,789,0002,117,632
3Jun 8, 2026 00:2510,691362,089,070341,026,00011,805,0002,117,632
4Jun 8, 2026 00:2510,710362,638,997341,625,00011,832,0002,117,632
5Jun 8, 2026 00:2510,761364,259,193343,250,00011,877,0002,117,632
6Jun 8, 2026 00:2510,826366,328,456345,348,00011,916,0002,117,632
7Jun 8, 2026 00:2510,835366,543,546345,693,00011,881,0002,117,632
8Jun 8, 2026 00:2510,893368,707,711347,412,00012,086,0002,117,632
9Jun 8, 2026 00:2510,922369,545,171348,474,00011,975,0002,117,632