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 listFeb 1, 2025 11:12KeefeKeefeScore: 46,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 11:1244,5031,335,091,1733,019,523,000308,746,0002,527,232
2Feb 1, 2025 11:1245,1401,354,186,2673,042,515,000445,075,0002,531,328
3Feb 1, 2025 11:1245,4071,362,221,5333,058,561,000445,895,0002,625,536
4Feb 1, 2025 11:1246,8271,404,797,7223,045,049,000479,480,0002,719,744
5Feb 1, 2025 11:1246,8381,405,153,1543,055,927,000484,671,0002,732,032
6Feb 1, 2025 11:1248,3051,449,138,7733,064,209,000480,875,0002,646,016
7Feb 1, 2025 11:1249,6171,488,514,1043,075,472,000494,075,0002,883,584
8Feb 1, 2025 11:1249,8521,495,560,5223,036,469,000493,775,0002,629,632
9Feb 1, 2025 11:1252,2341,567,028,3383,050,905,000518,963,0002,908,160