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:46Joad NacerJoad NacerScore: 5,341Success
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:465,070152,105,614250,753,0004,995,0002,596,864
2Oct 2, 2024 18:465,133153,979,364239,649,0004,992,0002,834,432
3Oct 2, 2024 18:465,218156,553,115257,863,0004,997,0002,596,864
4Oct 2, 2024 18:465,334160,023,220266,764,0006,993,0002,785,280
5Oct 2, 2024 18:465,341160,222,907269,091,0004,001,0002,609,152
6Oct 2, 2024 18:465,378161,348,917266,629,0003,007,0002,588,672
7Oct 2, 2024 18:465,441163,232,424258,352,0005,006,0002,584,576
8Oct 2, 2024 18:465,569167,058,185268,438,0005,008,0002,641,920
9Oct 2, 2024 18:465,748172,448,683274,841,0003,997,0002,813,952