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:46olliecrowolliecrowScore: 12,137Success
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:479,716343,003,515281,674,00038,955,0002,519,040
2Mar 22, 2026 09:479,975357,915,244294,143,00035,017,0002,412,544
3Mar 22, 2026 09:4710,173356,720,475295,738,00039,964,0002,314,240
4Mar 22, 2026 09:4612,137423,752,170346,713,00053,800,0002,416,640
5Mar 22, 2026 09:4612,721445,127,543365,809,00053,971,0002,342,912
6Mar 22, 2026 09:4614,094495,668,795403,226,00061,881,0002,416,640