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 7, 2023 10:21matsuoka-601matsuoka-601Score: 85,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2023 10:2184,4382,868,288,1282,786,446,41602,273,280
2Jun 7, 2023 10:2185,1272,872,171,8522,809,183,45202,277,376
3Jun 7, 2023 10:2185,7802,907,139,1062,830,730,63702,269,184