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 listMar 22, 2026 09:54olliecrowolliecrowScore: 9,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 09:549,641340,992,934278,140,00040,020,0002,478,080
2Mar 22, 2026 09:549,665344,115,823264,968,00053,993,0002,416,640
3Mar 22, 2026 09:549,669348,804,160279,078,00040,011,0002,420,736
4Mar 22, 2026 09:549,683348,604,009279,593,00039,941,0002,416,640
5Mar 22, 2026 09:549,692335,751,386282,855,00036,981,0002,498,560
6Mar 22, 2026 09:549,753345,060,514276,870,00044,979,0002,519,040
7Mar 22, 2026 09:5410,076359,916,986286,575,00045,931,0002,494,464
8Mar 22, 2026 09:5410,191370,679,314301,259,00035,030,0002,347,008
9Mar 22, 2026 09:5410,659391,172,879297,950,00053,810,0002,342,912