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 listMay 5, 2026 12:03Victor MerckléVictor MerckléScore: 5,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 12:055,166155,006,338424,036,00013,568,0002,707,456
2May 5, 2026 12:055,189155,688,549427,295,00013,470,0002,711,552
3May 5, 2026 12:055,224156,722,670429,074,00011,105,0002,686,976
4May 5, 2026 12:055,239157,187,632426,320,00013,752,0002,715,648
5May 5, 2026 12:055,249157,493,861431,271,00010,016,0002,973,696
6May 5, 2026 12:055,262157,867,280431,262,00010,207,0002,703,360
7May 5, 2026 12:055,285158,557,415430,099,00010,705,0002,973,696
8May 5, 2026 12:055,291158,734,285430,743,00010,653,0002,707,456
9May 5, 2026 12:055,322159,683,878434,849,00010,415,0002,981,888