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 3, 2025 16:33prashantbits01prashantbits01Score: 459,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 16:33454,94115,049,930,73914,921,114,00091,939,0002,498,560
2Nov 3, 2025 16:33456,46815,098,684,24614,962,521,000100,936,0002,506,752
3Nov 3, 2025 16:33456,79315,111,127,24414,980,235,00093,938,0002,519,040
4Nov 3, 2025 16:33457,04715,114,846,09514,972,616,000109,931,0002,502,656
5Nov 3, 2025 16:33459,45215,193,665,27415,081,970,00079,952,0002,301,952
6Nov 3, 2025 16:33459,87515,218,021,52715,071,942,000103,937,0002,285,568
7Nov 3, 2025 16:33460,21515,223,827,94715,082,165,000104,931,0002,502,656
8Nov 3, 2025 16:33461,94215,280,402,41615,149,155,00094,944,0002,453,504
9Nov 3, 2025 16:33462,22615,286,358,77515,153,506,00099,937,0002,375,680