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 listMay 3, 2026 20:22TudyMTudyMScore: 36,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:2335,9341,078,023,5231,009,572,00051,215,0002,592,768
2May 3, 2026 20:2336,0681,082,046,4901,014,106,00051,062,0002,625,536
3May 3, 2026 20:2336,0951,082,875,3741,014,128,00053,266,0002,576,384
4May 3, 2026 20:2336,1181,083,557,1321,015,991,00050,076,0002,560,000
5May 3, 2026 20:2336,1861,085,586,7541,016,384,00052,255,0002,535,424
6May 3, 2026 20:2336,2391,087,179,2851,014,636,00054,034,0002,551,808
7May 3, 2026 20:2336,3031,089,109,4011,013,686,00053,958,0002,609,152
8May 3, 2026 20:2336,3721,091,179,9291,017,577,00055,829,0002,560,000
9May 3, 2026 20:2337,9081,137,253,1991,066,256,00053,248,0002,600,960