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 listOct 2, 2024 18:44Joad NacerJoad NacerScore: 5,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2024 18:445,111153,337,727243,969,0004,999,0002,633,728
2Oct 2, 2024 18:445,400162,002,999257,952,0006,998,0002,830,336
3Oct 2, 2024 18:445,402162,055,148267,497,0004,007,0002,592,768
4Oct 2, 2024 18:445,429162,878,695263,111,0003,001,0002,793,472
5Oct 2, 2024 18:445,508165,228,514271,078,0005,001,0002,547,712
6Oct 2, 2024 18:445,552166,548,843261,246,0005,004,0002,674,688
7Oct 2, 2024 18:445,654169,631,426272,412,0005,007,0002,686,976
8Oct 2, 2024 18:445,704171,119,329272,389,0003,991,0002,809,856
9Oct 2, 2024 18:445,887176,603,414272,534,0005,989,0002,748,416