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 22, 2026 11:24M-RochatM-RochatScore: 20,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 11:2519,883596,492,400580,198,0004,213,0002,113,536
2May 22, 2026 11:2519,904597,131,182581,443,0004,198,0002,113,536
3May 22, 2026 11:2519,928597,855,647584,080,0004,256,0002,113,536
4May 22, 2026 11:2520,009600,289,317582,775,0004,274,0002,113,536
5May 22, 2026 11:2520,146604,388,134590,346,0004,281,0002,113,536
6May 22, 2026 11:2520,188605,663,133588,698,0004,010,0002,113,536
7May 22, 2026 11:2520,259607,782,793591,581,0006,184,0002,113,536
8May 22, 2026 11:2520,296608,907,576594,662,0004,123,0002,113,536
9May 22, 2026 11:2521,436643,089,810629,174,0004,196,0002,113,536