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 06:47Tomislav TunkovicTomislav TunkovicScore: 2,895Success
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 06:482,83385,013,937212,782,00011,246,0002,162,688
2Aug 15, 2026 06:482,86786,015,725214,817,00011,384,0002,158,592
3Aug 15, 2026 06:482,89086,709,112217,752,00011,465,0002,162,688
4Aug 15, 2026 06:482,89086,714,727218,998,00011,200,0002,162,688
5Aug 15, 2026 06:482,89586,875,976219,914,00011,683,0002,162,688
6Aug 15, 2026 06:482,91187,355,058217,275,00011,722,0002,158,592
7Aug 15, 2026 06:482,92787,819,971218,878,00010,721,0002,154,496
8Aug 15, 2026 06:482,96688,999,921215,004,00010,995,0002,154,496
9Aug 15, 2026 06:482,98689,593,943223,257,00011,528,0002,162,688