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 listJan 7, 2026 22:26Josu San MartinJosu San MartinScore: 14,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 22:2613,076461,463,850430,509,0001,001,0002,306,048
2Jan 7, 2026 22:2613,870489,645,446454,705,0002,998,0002,338,816
3Jan 7, 2026 22:2614,054497,436,733460,795,0002,998,0002,289,664
4Jan 7, 2026 22:2614,301497,736,375468,931,0002,999,0002,338,816
5Jan 7, 2026 22:2614,370500,334,764471,207,0003,001,0002,289,664
6Jan 7, 2026 22:2614,493504,386,060476,255,0002,001,0002,338,816
7Jan 7, 2026 22:2614,555508,344,718477,322,0003,002,0002,289,664
8Jan 7, 2026 22:2615,243528,348,103500,025,0003,000,0002,289,664
9Jan 7, 2026 22:2615,453536,412,806506,937,0002,999,0002,334,720