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 listAug 17, 2026 06:51marko1597marko1597Score: 8,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 06:548,177245,329,586232,742,0004,296,0002,121,728stderr
2Aug 17, 2026 06:548,179245,388,393232,924,0004,309,0002,121,728stderr
3Aug 17, 2026 06:548,180245,410,616232,986,0004,160,0002,121,728stderr
4Aug 17, 2026 06:548,191245,741,627233,395,0004,247,0002,121,728stderr
5Aug 17, 2026 06:548,193245,790,049233,421,0004,152,0002,121,728stderr
6Aug 17, 2026 06:548,205246,150,591233,568,0004,151,0002,121,728stderr
7Aug 17, 2026 06:548,208246,248,696233,688,0004,322,0002,121,728stderr
8Aug 17, 2026 06:548,219246,575,422234,116,0004,136,0002,121,728stderr
9Aug 17, 2026 06:548,256247,685,958233,344,0004,306,0002,121,728stderr