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 18, 2026 04:30Josu San MartinJosu San MartinScore: 6,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:305,231200,746,081170,643,0001,995,0002,396,160
2Mar 18, 2026 04:305,245193,366,792172,097,0001,000,0002,306,048
3Mar 18, 2026 04:305,277195,969,229172,136,0002,001,0002,514,944
4Mar 18, 2026 04:306,731247,807,941217,116,0005,002,0002,404,352
5Mar 18, 2026 04:306,765247,015,967219,242,0004,004,0002,392,064
6Mar 18, 2026 04:306,932250,630,708224,748,0003,995,0002,338,816