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 17, 2026 23:34Victor MerckléVictor MerckléScore: 3,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:353,465103,970,170277,954,0001,007,0002,654,208
2Jun 17, 2026 23:353,467104,025,128276,995,0003,084,0002,650,112
3Jun 17, 2026 23:353,468104,040,188277,839,0001,015,0002,654,208
4Jun 17, 2026 23:353,491104,731,476280,972,0001,018,0002,654,208
5Jun 17, 2026 23:353,505105,164,066282,253,0001,031,0002,654,208
6Jun 17, 2026 23:353,525105,761,124281,926,0001,004,0002,654,208
7Jun 17, 2026 23:353,529105,881,260283,958,0001,007,0002,654,208
8Jun 17, 2026 23:353,537106,110,235281,405,0001,012,0002,654,208
9Jun 17, 2026 23:353,638109,150,106287,830,0001,008,0002,654,208