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 17, 2026 12:51Victor MerckléVictor MerckléScore: 2,432Success
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 12:532,39671,882,105184,910,0001,185,0002,170,880stderr
2Aug 17, 2026 12:532,39871,940,886185,441,0001,225,0002,170,880stderr
3Aug 17, 2026 12:532,42272,669,399184,801,0001,216,0002,170,880stderr
4Aug 17, 2026 12:532,43272,967,352184,881,0001,241,0002,170,880stderr
5Aug 17, 2026 12:532,43272,972,307184,669,0001,268,0002,170,880stderr
6Aug 17, 2026 12:532,44173,238,712183,759,0001,226,0002,170,880stderr
7Aug 17, 2026 12:532,78283,468,004189,039,0001,002,0002,170,880stderr
8Aug 17, 2026 12:532,78583,573,434192,849,0001,308,0002,170,880stderr
9Aug 17, 2026 12:532,85685,683,384191,670,0001,018,0002,170,880stderr