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 listAug 15, 2026 07:07Tomislav TunkovicTomislav TunkovicScore: 2,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 07:082,87186,159,779215,537,00011,615,0002,162,688
2Aug 15, 2026 07:082,88586,553,566211,465,00011,472,0002,154,496
3Aug 15, 2026 07:082,91087,321,752216,689,00011,365,0002,162,688
4Aug 15, 2026 07:082,92987,872,103216,852,00011,947,0002,154,496
5Aug 15, 2026 07:082,93788,110,190219,806,00010,654,0002,158,592
6Aug 15, 2026 07:082,93888,161,333220,026,00010,917,0002,154,496
7Aug 15, 2026 07:082,93988,185,555219,333,00011,473,0002,158,592
8Aug 15, 2026 07:082,94788,422,764219,640,00010,754,0002,162,688
9Aug 15, 2026 07:083,03991,171,572222,789,00011,844,0002,154,496