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:45Joad NacerJoad NacerScore: 5,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2024 12:005,008150,230,239244,641,0003,994,0002,752,512
2Oct 3, 2024 12:005,333160,001,582263,455,0006,985,0002,691,072
3Oct 3, 2024 12:005,396161,875,883259,938,0004,998,0002,772,992
4Oct 2, 2024 18:455,445163,342,010269,693,0003,007,0002,666,496
5Oct 2, 2024 18:455,755172,643,041280,960,0003,999,0002,748,416
6Oct 2, 2024 18:455,808174,251,368278,022,0005,000,0002,719,744