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 listJun 11, 2026 01:01Victor MerckléVictor MerckléScore: 3,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 01:043,26697,992,369249,733,0003,571,0002,150,400
2Jun 11, 2026 01:043,28598,550,474249,525,0003,515,0002,150,400
3Jun 11, 2026 01:043,29398,800,449250,002,0003,555,0002,150,400
4Jun 11, 2026 01:043,30699,208,151252,666,0003,584,0002,150,400
5Jun 11, 2026 01:043,31299,371,075251,957,0003,616,0002,150,400
6Jun 11, 2026 01:043,31999,580,927253,505,0003,605,0002,150,400
7Jun 11, 2026 01:043,32099,619,022252,826,0003,568,0002,150,400
8Jun 11, 2026 01:043,370101,117,435253,837,0003,561,0002,211,840
9Jun 11, 2026 01:043,395101,854,927255,013,0003,561,0002,211,840