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:05Victor MerckléVictor MerckléScore: 4,009Success
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:063,960118,820,051317,934,0002,156,0002,392,064
2Jun 9, 2026 23:063,969119,082,462317,043,0002,144,0002,392,064
3Jun 9, 2026 23:063,986119,594,794315,023,0002,209,0002,416,640
4Jun 9, 2026 23:063,999119,997,895319,148,0001,089,0002,412,544
5Jun 9, 2026 23:064,009120,272,399318,080,0002,194,0002,416,640
6Jun 9, 2026 23:064,014120,447,819321,493,0002,072,0002,412,544
7Jun 9, 2026 23:064,014120,431,569318,962,0002,024,0002,416,640
8Jun 9, 2026 23:064,023120,712,468321,736,0002,070,0002,412,544
9Jun 9, 2026 23:064,029120,870,429322,146,0002,164,0002,371,584