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 18, 2026 03:47Josu San MartinJosu San MartinScore: 4,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 03:514,743142,318,463199,256,0002,121,0002,142,208
2Aug 18, 2026 03:514,749142,479,564199,604,0002,122,0002,142,208
3Aug 18, 2026 03:514,749142,476,127201,091,0002,111,0002,142,208
4Aug 18, 2026 03:514,762142,879,629200,255,0002,116,0002,142,208
5Aug 18, 2026 03:514,765142,957,966201,401,0002,130,0002,142,208
6Aug 18, 2026 03:514,766142,989,770199,736,0002,122,0002,142,208
7Aug 18, 2026 03:514,766142,992,512200,473,0002,109,0002,142,208
8Aug 18, 2026 03:514,770143,121,826201,143,0002,117,0002,142,208
9Aug 18, 2026 03:514,778143,352,360199,961,0002,110,0002,142,208