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 12, 2026 08:15Victor MerckléVictor MerckléScore: 3,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 08:163,08692,595,126240,908,0003,113,0002,654,208
2Jun 12, 2026 08:163,09592,870,824241,673,0003,083,0002,654,208
3Jun 12, 2026 08:163,10793,213,582242,131,0003,035,0002,654,208
4Jun 12, 2026 08:163,11393,413,446243,660,0003,052,0002,650,112
5Jun 12, 2026 08:163,13093,918,290244,543,0003,134,0002,654,208
6Jun 12, 2026 08:163,13193,949,194245,332,0003,146,0002,654,208
7Jun 12, 2026 08:163,18795,616,669245,010,0003,118,0002,654,208
8Jun 12, 2026 08:163,20796,232,101246,811,0003,065,0002,654,208
9Jun 12, 2026 08:163,21396,419,554247,346,0003,053,0002,654,208