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 27, 2026 22:41TudyMTudyMScore: 13,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:4913,291398,759,2381,105,754,00022,994,0002,650,112
2Apr 27, 2026 22:4913,307399,229,0831,104,139,00028,003,0002,789,376
3Apr 27, 2026 22:4913,340400,212,0731,109,732,00020,994,0002,777,088
4Apr 27, 2026 22:4913,383401,504,4391,106,203,00023,004,0002,752,512
5Apr 27, 2026 22:4913,436403,090,9631,105,678,00023,971,0002,756,608
6Apr 27, 2026 22:4913,441403,233,2241,106,256,00023,983,0002,793,472
7Apr 27, 2026 22:4913,475404,251,5981,107,780,00021,975,0002,592,768
8Apr 27, 2026 22:4913,490404,721,7211,099,845,00028,995,0002,789,376
9Apr 27, 2026 22:4913,767413,012,3261,105,482,00022,968,0002,367,488