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 19:40M-RochatM-RochatScore: 19,958Success
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 19:4119,556586,689,065574,236,0004,149,0002,117,632
2May 22, 2026 19:4119,611588,332,328576,318,0004,068,0002,117,632
3May 22, 2026 19:4119,742592,273,835577,318,0004,014,0002,117,632
4May 22, 2026 19:4119,807594,226,498582,190,0004,043,0002,117,632
5May 22, 2026 19:4119,958598,766,429584,239,0004,155,0002,117,632
6May 22, 2026 19:4120,204606,130,477592,950,0004,054,0002,117,632
7May 22, 2026 19:4120,244607,348,995594,350,0004,124,0002,117,632
8May 22, 2026 19:4120,252607,561,806593,310,0004,018,0002,117,632
9May 22, 2026 19:4120,500615,001,839599,217,0004,180,0002,117,632