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 listNov 11, 2024 09:56E SequeiraE SequeiraScore: 49,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:5648,6911,460,737,2293,819,495,00030,979,0002,596,864
2Nov 11, 2024 09:5648,9821,469,450,3233,827,904,00025,985,0002,641,920
3Nov 11, 2024 09:5649,3351,480,051,9633,884,340,00032,935,0002,609,152
4Nov 11, 2024 09:5649,3921,481,748,0813,867,864,00027,970,0002,682,880
5Nov 11, 2024 09:5649,4231,482,693,4053,885,002,00029,938,0002,600,960
6Nov 11, 2024 09:5649,4641,483,913,2303,879,671,00031,931,0002,596,864
7Nov 11, 2024 09:5649,6101,488,301,4983,876,795,00031,932,0002,764,800
8Nov 11, 2024 09:5649,6921,490,768,4043,888,393,00035,911,0002,596,864
9Nov 11, 2024 09:5651,0221,530,672,4163,864,891,00032,007,0002,359,296