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 03:04anboto1anboto1Score: 9,490Success
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 03:059,454321,307,044301,563,00010,442,0002,117,632
2Jun 8, 2026 03:059,461322,138,597301,748,00010,471,0002,117,632
3Jun 8, 2026 03:059,472321,938,647301,442,00011,147,0002,117,632
4Jun 8, 2026 03:059,474322,386,162302,223,00010,450,0002,117,632
5Jun 8, 2026 03:059,490322,441,571302,200,00010,971,0002,117,632
6Jun 8, 2026 03:059,494322,561,022302,355,00010,948,0002,117,632
7Jun 8, 2026 03:059,498323,222,799302,872,00010,569,0002,117,632
8Jun 8, 2026 03:059,514324,788,683302,850,00011,130,0002,117,632
9Jun 8, 2026 03:059,522324,023,849303,687,00010,571,0002,117,632