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 9, 2024 09:22Joad NacerJoad NacerScore: 6,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 09:226,352190,570,063155,086,00014,007,0002,551,808
2Sep 9, 2024 09:226,446193,385,240158,944,00011,995,0002,596,864
3Sep 9, 2024 09:226,477194,316,045160,701,00011,977,0002,711,552
4Sep 9, 2024 09:226,594197,824,989159,558,00012,964,0002,711,552
5Sep 9, 2024 09:226,657199,714,625163,654,00013,970,0002,711,552
6Sep 9, 2024 09:226,738202,129,670169,034,00012,002,0002,600,960
7Sep 9, 2024 09:226,841205,243,327167,737,00012,979,0002,703,360
8Sep 9, 2024 09:226,909207,284,671166,450,00014,950,0002,600,960
9Sep 9, 2024 09:227,728231,838,983189,409,00014,953,0002,711,552