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 listApr 24, 2025 10:10KeefeKeefeScore: 36,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 10:1036,0441,081,333,7292,981,518,00037,981,0002,539,520
2Apr 24, 2025 10:1036,2721,088,157,3462,982,350,00038,952,0002,351,104
3Apr 24, 2025 10:1036,4491,093,471,1233,025,449,00031,983,0002,420,736
4Apr 24, 2025 10:1036,4741,094,216,4482,996,310,00040,963,0002,539,520
5Apr 24, 2025 10:1036,5601,096,797,0743,022,028,00036,963,0002,535,424
6Apr 24, 2025 10:1036,5781,097,344,4293,027,770,00034,974,0002,535,424
7Apr 24, 2025 10:1036,7371,102,122,7623,016,533,00038,955,0002,703,360
8Apr 24, 2025 10:1036,9471,108,423,8323,020,291,00040,949,0002,396,160
9Apr 24, 2025 10:1037,4201,122,614,5712,987,840,00035,973,0002,535,424