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 listSep 1, 2026 10:57Victor MerckléVictor MerckléScore: 4,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:584,477134,314,022368,449,0002,023,0002,170,880stderr
2Sep 1, 2026 10:584,484134,528,258369,695,0002,035,0002,170,880stderr
3Sep 1, 2026 10:584,484134,537,427369,502,0001,037,0002,170,880stderr
4Sep 1, 2026 10:584,490134,718,935369,917,0001,020,0002,170,880stderr
5Sep 1, 2026 10:584,492134,772,413370,232,0002,024,0002,170,880stderr
6Sep 1, 2026 10:584,511135,333,159372,200,0002,043,0002,170,880stderr
7Sep 1, 2026 10:584,514135,430,898372,122,0002,050,0002,170,880stderr
8Sep 1, 2026 10:584,521135,635,152374,704,0002,024,0002,170,880stderr
9Sep 1, 2026 10:584,549136,499,579373,542,0001,035,0002,170,880stderr