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 11, 2026 14:26Victor MerckléVictor MerckléScore: 3,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 14:273,10593,157,224244,530,0002,207,0002,138,112
2Jun 11, 2026 14:273,13193,940,415246,715,0002,036,0002,138,112
3Jun 11, 2026 14:273,13994,196,872245,539,0003,152,0002,138,112
4Jun 11, 2026 14:273,14394,313,494246,508,0003,126,0002,138,112
5Jun 11, 2026 14:273,14494,321,872247,580,0001,018,0002,134,016
6Jun 11, 2026 14:273,15594,654,714247,520,0002,207,0002,138,112
7Jun 11, 2026 14:273,16094,820,943248,389,0002,064,0002,138,112
8Jun 11, 2026 14:273,17095,125,887248,137,0001,012,0002,138,112
9Jun 11, 2026 14:273,17695,280,280249,411,0002,206,0002,138,112