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 listMar 22, 2026 22:31Dominique GarmierDominique GarmierScore: 8,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 22:318,049241,476,789607,321,00013,006,0002,490,368
2Mar 22, 2026 22:318,154244,622,120607,508,00013,988,0002,621,440
3Mar 22, 2026 22:318,167245,015,847606,465,00013,987,0002,572,288
4Mar 22, 2026 22:318,178245,342,906604,778,00015,019,0002,633,728
5Mar 22, 2026 22:318,215246,458,112630,211,00017,977,0002,543,616
6Mar 22, 2026 22:318,239247,178,675630,778,00013,995,0002,523,136
7Mar 22, 2026 22:318,316249,493,883609,158,00014,003,0002,617,344
8Mar 22, 2026 22:318,494254,810,060634,582,0008,994,0002,551,808
9Mar 22, 2026 22:318,675260,239,443630,085,00016,975,0002,682,880