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:19M-RochatM-RochatScore: 20,238Success
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:1919,967599,018,467583,903,0004,101,0002,113,536
2May 22, 2026 11:1919,995599,872,416586,173,0004,087,0002,113,536
3May 22, 2026 11:1920,077602,322,511587,693,0004,113,0002,113,536
4May 22, 2026 11:1920,225606,765,484592,239,0004,121,0002,113,536
5May 22, 2026 11:1920,238607,147,431593,434,0004,140,0002,113,536
6May 22, 2026 11:1920,299608,998,873593,514,0004,150,0002,113,536
7May 22, 2026 11:1921,618648,552,735635,332,0003,006,0002,113,536
8May 22, 2026 11:1921,669650,070,380635,298,0004,027,0002,113,536
9May 22, 2026 11:1921,687650,638,279636,608,0004,065,0002,113,536