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 listSep 26, 2024 15:32Yuriy LyfenkoYuriy LyfenkoScore: 8,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2024 15:328,941324,188,327291,048,0004,000,0002,375,680
2Sep 26, 2024 15:328,986327,669,893293,533,0002,995,0002,363,392
3Sep 26, 2024 15:328,987322,868,680292,576,0003,994,0002,367,488