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 18:08Tomislav TunkovicTomislav TunkovicScore: 2,867Success
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 18:122,77383,206,615209,193,00012,665,00065,536
2Aug 15, 2026 18:122,80884,240,270212,087,00011,341,00065,536
3Aug 15, 2026 18:122,82484,740,306210,705,00011,662,00065,536
4Aug 15, 2026 18:122,83985,198,065213,864,00011,705,00065,536
5Aug 15, 2026 18:122,86786,034,376212,915,00011,100,00061,440
6Aug 15, 2026 18:122,86786,012,479216,116,00011,139,00065,536
7Aug 15, 2026 18:122,90687,195,316218,254,00011,710,00065,536
8Aug 15, 2026 18:122,93488,021,379216,194,00010,727,00065,536
9Aug 15, 2026 18:122,94288,266,190220,296,00010,745,00065,536