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 listNov 11, 2024 18:21ZOTTIGZOTTIGScore: 353,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 18:21350,65411,604,473,59211,268,750,000302,832,0002,375,680
2Nov 11, 2024 18:21353,95611,718,796,75011,338,775,000341,782,0002,301,952
3Nov 11, 2024 18:21363,53512,030,267,46111,683,872,000312,782,0002,506,752