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 2, 2026 13:44Victor MerckléVictor MerckléScore: 5,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:465,142154,275,020422,486,0007,713,0002,605,056stderr
2Aug 2, 2026 13:465,150154,527,169424,050,0009,558,0002,392,064stderr
3Aug 2, 2026 13:465,155154,651,673423,407,0008,654,0002,605,056stderr
4Aug 2, 2026 13:465,170155,122,401423,754,0009,151,0002,605,056stderr
5Aug 2, 2026 13:465,176155,286,665426,429,0009,375,0002,605,056stderr
6Aug 2, 2026 13:465,201156,031,520426,311,0009,689,0002,605,056stderr
7Aug 2, 2026 13:465,211156,347,857426,455,0008,852,0002,609,152stderr
8Aug 2, 2026 13:465,216156,480,000427,831,0009,634,0002,605,056stderr
9Aug 2, 2026 13:465,218156,548,198429,852,0009,450,0002,605,056stderr