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 15, 2026 02:08Josu San MartinJosu San MartinScore: 4,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 02:094,082122,477,993168,263,0002,116,0002,146,304
2Sep 15, 2026 02:094,085122,560,519169,018,0002,096,0002,142,208
3Sep 15, 2026 02:094,090122,729,718168,834,0002,297,0002,146,304
4Sep 15, 2026 02:094,091122,730,330168,460,0002,126,0002,146,304
5Sep 15, 2026 02:094,100123,003,845168,816,0002,175,0002,146,304
6Sep 15, 2026 02:094,103123,108,348169,307,0002,154,0002,146,304
7Sep 15, 2026 02:094,106123,194,260169,298,0002,111,0002,146,304
8Sep 15, 2026 02:094,115123,472,995169,503,0002,109,0002,146,304
9Sep 15, 2026 02:094,153124,592,137169,285,0002,123,0002,146,304