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 listAug 16, 2026 02:32Victor MerckléVictor MerckléScore: 4,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 02:334,526135,805,307373,915,0004,151,0002,326,528stderr
2Aug 16, 2026 02:334,540136,225,418372,259,0003,008,0002,260,992stderr
3Aug 16, 2026 02:334,678140,341,398387,057,0004,004,0002,326,528stderr
4Aug 16, 2026 02:334,740142,226,202391,975,0003,057,0002,318,336stderr
5Aug 16, 2026 02:334,797143,916,458395,249,0003,064,0002,355,200stderr
6Aug 16, 2026 02:334,859145,770,833399,293,0003,055,0002,478,080stderr
7Aug 16, 2026 02:334,862145,866,482403,489,0004,110,0002,371,584stderr
8Aug 16, 2026 02:334,868146,041,349400,644,0004,292,0002,527,232stderr
9Aug 16, 2026 02:334,898146,953,028402,522,0003,062,0002,506,752stderr