Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listSep 1, 2026 06:41Victor MerckléVictor MerckléScore: 1,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:421,74352,299,827124,913,0002,023,0002,158,592stderr
2Sep 1, 2026 06:421,74552,376,913124,149,0002,054,0002,166,784stderr
3Sep 1, 2026 06:421,75552,669,674125,670,0001,017,0002,166,784stderr
4Sep 1, 2026 06:421,76552,973,178125,052,0002,032,0002,162,688stderr
5Sep 1, 2026 06:421,76552,969,826124,994,0001,033,0002,166,784stderr
6Sep 1, 2026 06:421,77153,150,974126,920,0002,060,0002,162,688stderr
7Sep 1, 2026 06:421,77653,281,391125,615,0001,032,0002,166,784stderr
8Sep 1, 2026 06:421,78053,409,340125,542,0001,031,0002,166,784stderr
9Sep 1, 2026 06:421,79453,846,430125,935,0001,027,0002,166,784stderr