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 19, 2026 09:08Victor MerckléVictor MerckléScore: 4,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 09:094,325129,773,546350,945,0001,006,0002,654,208
2Jun 19, 2026 09:094,399131,987,956355,530,0003,057,0002,650,112
3Jun 19, 2026 09:094,435133,073,559359,246,0001,009,0002,654,208
4Jun 19, 2026 09:094,448133,441,212357,844,0002,104,0002,650,112
5Jun 19, 2026 09:094,453133,607,899357,251,0002,081,0002,650,112
6Jun 19, 2026 09:094,471134,138,519356,366,0003,129,0002,650,112
7Jun 19, 2026 09:094,498134,949,441359,027,0003,095,0002,654,208
8Jun 19, 2026 09:094,502135,060,308359,299,0002,109,0002,654,208
9Jun 19, 2026 09:094,539136,186,183362,012,0003,083,0002,654,208