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 8, 2026 02:29anboto1anboto1Score: 5,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:305,944205,480,287181,752,00014,408,0002,117,632
2Jun 8, 2026 02:305,947205,758,342181,972,00014,279,0002,117,632
3Jun 8, 2026 02:305,970206,195,951182,476,00014,537,0002,117,632
4Jun 8, 2026 02:305,977206,518,026182,196,00015,063,0002,117,632
5Jun 8, 2026 02:305,998207,161,428182,719,00015,219,0002,117,632
6Jun 8, 2026 02:306,008207,627,043183,828,00014,465,0002,117,632
7Jun 8, 2026 02:306,018207,895,464184,042,00014,567,0002,117,632
8Jun 8, 2026 02:306,036208,434,268184,643,00014,573,0002,117,632
9Jun 8, 2026 02:306,059209,300,919184,631,00015,327,0002,117,632