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 10, 2026 22:02Victor MerckléVictor MerckléScore: 43,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 22:0443,1741,295,233,7031,268,826,00017,933,0002,195,456
2Jun 10, 2026 22:0443,2771,298,334,6401,270,678,00018,494,0002,174,976
3Jun 10, 2026 22:0443,2961,298,895,5051,269,595,00018,109,0002,195,456
4Jun 10, 2026 22:0443,3171,299,517,6091,270,066,00018,205,0002,195,456
5Jun 10, 2026 22:0443,3341,300,047,8081,269,849,00019,366,0002,174,976
6Jun 10, 2026 22:0443,3421,300,277,3841,271,562,00017,329,0002,158,592
7Jun 10, 2026 22:0443,3901,301,717,8791,272,475,00018,191,0002,211,840
8Jun 10, 2026 22:0443,3991,301,998,6061,274,141,00018,491,0002,174,976
9Jun 10, 2026 22:0443,4061,302,190,8701,271,531,00018,304,0002,195,456