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 9, 2026 03:21olliecrowolliecrowScore: 14,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 03:3214,367500,304,552465,120,0009,002,0002,310,144
2Mar 9, 2026 03:3214,390498,339,635465,876,0008,997,0002,506,752
3Mar 9, 2026 03:2114,468505,870,350468,426,0009,008,0002,478,080
4Mar 9, 2026 03:2114,475504,212,053468,692,0008,994,0002,510,848
5Mar 9, 2026 03:3214,543506,678,923470,937,0008,998,0002,449,408
6Mar 9, 2026 03:2114,574502,503,357471,936,0008,998,0002,428,928