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 9, 2026 23:16Victor 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
1Jun 9, 2026 23:170103,255,592268,021,0002,307,0002,678,784expected "1023400 ", got "1023399 "
2Jun 9, 2026 23:173,361100,859,388263,559,0002,282,0002,678,784
3Jun 9, 2026 23:173,379101,375,510265,431,0002,212,0002,674,688
4Jun 9, 2026 23:173,388101,663,827266,549,0002,191,0002,674,688
5Jun 9, 2026 23:173,393101,801,153267,342,0002,282,0002,674,688
6Jun 9, 2026 23:173,421102,655,693270,829,0002,180,0002,674,688
7Jun 9, 2026 23:173,500105,029,897271,193,0002,292,0002,678,784
8Jun 9, 2026 23:173,511105,345,297271,583,0002,303,0002,678,784
9Jun 9, 2026 23:173,516105,490,613276,113,0002,199,0002,674,688