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 22, 2026 17:04olliecrowolliecrowScore: 6,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 17:046,683200,500,783525,083,0008,984,0002,797,568
2Apr 22, 2026 17:046,742202,284,539520,528,00011,011,0002,945,024
3Apr 22, 2026 17:046,789203,671,370524,924,0008,981,0002,846,720
4Apr 22, 2026 17:046,827204,821,844522,307,0008,988,0002,781,184
5Apr 22, 2026 17:046,841205,237,491523,612,0009,010,0002,756,608
6Apr 22, 2026 17:046,855205,651,049521,605,00010,011,0002,842,624
7Apr 22, 2026 17:046,876206,309,793525,867,0008,980,0003,026,944
8Apr 22, 2026 17:046,912207,364,119522,430,00010,008,0002,543,616
9Apr 22, 2026 17:046,976209,309,973525,199,0008,986,0002,584,576