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 16, 2026 23:09Tomislav TunkovicTomislav TunkovicScore: 2,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 03:042,03361,009,550152,244,0001,027,00057,344
2Aug 17, 2026 03:042,03961,199,709151,242,0001,009,00065,536
3Aug 17, 2026 03:042,05561,676,700153,210,0001,045,00057,344
4Aug 17, 2026 03:042,05861,752,960154,131,0001,077,00057,344
5Aug 17, 2026 03:042,06561,969,573154,944,0001,017,00057,344
6Aug 17, 2026 03:042,06862,048,783154,648,0002,002,00057,344
7Aug 17, 2026 03:042,08562,562,705154,831,0002,131,00057,344
8Aug 17, 2026 03:042,09562,858,830150,176,0002,016,00073,728
9Aug 17, 2026 03:042,11463,431,977151,001,0002,011,00065,536