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 listJun 5, 2026 15:10Victor MerckléVictor MerckléScore: 8,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 15:118,672260,160,942371,215,00010,887,0002,363,392
2Jun 5, 2026 15:118,721261,635,423375,854,0008,989,0002,363,392
3Jun 5, 2026 15:118,723261,698,495376,198,0008,889,0002,363,392
4Jun 5, 2026 15:118,787263,638,592377,624,0008,108,0002,363,392
5Jun 5, 2026 15:118,791263,730,669378,262,0008,913,0002,363,392
6Jun 5, 2026 15:118,792263,767,096377,730,00010,019,0002,363,392
7Jun 5, 2026 15:118,851265,551,770377,324,0007,973,0002,363,392
8Jun 5, 2026 15:118,880266,423,689383,009,0009,919,0002,359,296
9Jun 5, 2026 15:118,901267,031,359385,567,0008,955,0002,363,392