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 listMay 1, 2026 08:28Dominique GarmierDominique GarmierScore: 13,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 08:2913,258456,173,181432,522,0004,994,0002,469,888
2May 1, 2026 08:2913,314453,690,590435,371,0003,994,0002,293,760
3May 1, 2026 08:2913,343463,652,728436,350,0003,994,0002,461,696
4May 1, 2026 08:2913,382458,437,681436,617,0004,995,0002,461,696
5May 1, 2026 08:2913,402456,318,880438,266,0004,002,0002,469,888
6May 1, 2026 08:2913,443465,992,242439,623,0003,996,0002,457,600
7May 1, 2026 08:2913,512466,412,285441,898,0003,999,0002,461,696
8May 1, 2026 08:2913,542461,207,082442,897,0003,999,0002,527,232
9May 1, 2026 08:2913,570466,532,064442,819,0004,997,0002,465,792