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 listJun 27, 2026 00:02Victor MerckléVictor MerckléScore: 2,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:032,90987,279,799234,024,0003,109,0002,584,576
2Jun 27, 2026 00:032,92087,623,346235,244,0003,107,0002,584,576
3Jun 27, 2026 00:032,94388,307,999237,396,0003,063,0002,584,576
4Jun 27, 2026 00:032,97789,317,723239,978,0003,021,0002,580,480
5Jun 27, 2026 00:032,99589,870,074241,995,0003,087,0002,580,480
6Jun 27, 2026 00:032,99689,892,755242,928,0002,072,0002,584,576
7Jun 27, 2026 00:032,99889,940,574242,041,0003,050,0002,584,576
8Jun 27, 2026 00:033,01390,411,946243,724,0003,075,0002,584,576
9Jun 27, 2026 00:033,01790,511,821238,198,0003,127,0002,584,576