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 23, 2026 18:50Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:510971,139,401947,635,00013,342,0002,117,632expected "1025282 ", got "293502440820709224 "stderr
2Aug 23, 2026 18:510965,093,924940,390,00013,305,0002,117,632expected "1019817 ", got "293442440250709035 "stderr
3Aug 23, 2026 18:510980,817,700956,648,00013,429,0002,117,632expected "1021169 ", got "293882440980708932 "stderr