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 11, 2026 16:58olliecrowolliecrowScore: 14,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 16:5814,259498,271,929462,561,0007,992,0002,355,200
2Mar 11, 2026 16:5814,262496,644,948462,655,0007,994,0002,375,680
3Mar 11, 2026 16:5814,281492,378,246462,283,0009,005,0002,330,624
4Mar 11, 2026 16:5814,293500,527,519462,682,0008,993,0002,347,008
5Mar 11, 2026 16:5814,332496,212,130464,946,0007,999,0002,330,624
6Mar 11, 2026 16:5814,486507,070,134469,022,0009,000,0002,490,368
7Mar 11, 2026 16:5814,550504,146,963472,135,0008,002,0002,326,528
8Mar 11, 2026 16:5815,153529,381,569491,064,0008,982,0002,330,624
9Mar 11, 2026 16:5815,241532,347,891493,955,0008,999,0002,277,376