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 listJan 16, 2025 06:06Ian MckibbenIan MckibbenScore: 31,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 06:0631,428942,843,055842,487,00076,953,0002,752,512
2Jan 16, 2025 06:0631,542946,248,029830,603,00090,956,0002,629,632
3Jan 16, 2025 06:0631,570947,110,473835,279,00083,927,0002,736,128
4Jan 16, 2025 06:0631,617948,511,731845,279,00074,936,0002,641,920
5Jan 16, 2025 06:0631,664949,915,191829,111,00092,900,0002,641,920
6Jan 16, 2025 06:0631,719951,568,944837,045,00082,905,0002,609,152
7Jan 16, 2025 06:0631,750952,495,558832,064,00092,895,0002,637,824
8Jan 16, 2025 06:0631,810954,299,385842,608,00083,961,0002,650,112
9Jan 16, 2025 06:0631,885956,543,120835,864,00090,985,0002,625,536