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 8, 2026 02:48Victor MerckléVictor MerckléScore: 10,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:5010,616318,483,930910,869,0007,104,0002,682,880
2Jun 8, 2026 02:5010,649319,472,330911,575,0007,201,0002,682,880
3Jun 8, 2026 02:5010,657319,723,034916,304,0007,007,0002,682,880
4Jun 8, 2026 02:5010,702321,060,585911,490,0007,091,0002,416,640
5Jun 8, 2026 02:5010,746322,408,243926,043,0007,055,0002,686,976
6Jun 8, 2026 02:5010,761322,850,845925,918,0007,105,0002,433,024
7Jun 8, 2026 02:5010,779323,399,027928,033,0007,100,0002,445,312
8Jun 8, 2026 02:5010,790323,716,496930,687,0006,058,0002,416,640
9Jun 8, 2026 02:5010,858325,742,633932,475,0007,040,0002,416,640