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 21, 2026 17:15M-RochatM-RochatScore: 21,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:1621,711651,342,815636,889,0004,072,0002,113,536
2May 21, 2026 17:1621,728651,864,910637,434,0004,268,0002,113,536
3May 21, 2026 17:1621,736652,105,649638,573,0004,027,0002,113,536
4May 21, 2026 17:1621,743652,313,573637,588,0004,088,0002,113,536
5May 21, 2026 17:1621,856655,688,430642,170,0004,028,0002,113,536
6May 21, 2026 17:1621,880656,406,596640,564,0006,243,0002,113,536
7May 21, 2026 17:1622,205666,154,099651,310,0004,018,0002,113,536
8May 21, 2026 17:1622,516675,499,107659,625,0004,113,0002,113,536
9May 21, 2026 17:1622,709681,276,315663,158,0005,025,0002,113,536