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 listMay 22, 2026 11:43M-RochatM-RochatScore: 19,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 11:4419,916597,503,508581,607,0004,206,0002,113,536
2May 22, 2026 11:4419,924597,737,935583,990,0004,173,0002,113,536
3May 22, 2026 11:4419,947598,427,599582,625,0004,262,0002,113,536
4May 22, 2026 11:4419,958598,742,138584,770,0004,035,0002,113,536
5May 22, 2026 11:4419,978599,357,522584,524,0004,193,0002,113,536
6May 22, 2026 11:4419,987599,614,019584,638,0004,287,0002,113,536
7May 22, 2026 11:4420,132603,978,584588,258,0004,037,0002,113,536
8May 22, 2026 11:4420,148604,447,443589,713,0004,047,0002,113,536
9May 22, 2026 11:4420,163604,912,936589,614,0004,254,0002,113,536