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 05:36Victor MerckléVictor MerckléScore: 2,082Success
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 05:362,06561,962,133153,767,0002,057,0002,646,016stderr
2Sep 1, 2026 05:362,06561,969,864152,234,0002,012,0002,695,168stderr
3Sep 1, 2026 05:362,06661,992,893153,414,0002,031,0002,695,168stderr
4Sep 1, 2026 05:362,07162,144,299152,308,0001,031,0002,695,168stderr
5Sep 1, 2026 05:362,08262,472,063152,475,0001,032,0002,695,168stderr
6Sep 1, 2026 05:362,08362,497,585152,675,0001,033,0002,646,016stderr
7Sep 1, 2026 05:362,08762,610,294153,578,0001,025,0002,646,016stderr
8Sep 1, 2026 05:362,10763,217,056154,592,0001,035,0002,695,168stderr
9Sep 1, 2026 05:362,10763,239,885155,971,0001,036,0002,695,168stderr