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 18, 2026 01:59M-RochatM-RochatScore: 20,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 02:0020,329609,872,186597,393,0003,010,0002,113,536
2May 18, 2026 02:0020,522615,667,849599,834,0004,006,0002,113,536
3May 18, 2026 02:0020,541616,249,034602,686,0004,040,0002,113,536
4May 18, 2026 02:0020,697620,934,159607,206,0004,053,0002,113,536
5May 18, 2026 02:0020,708621,247,810607,508,0004,109,0002,113,536
6May 18, 2026 02:0020,725621,765,253608,146,0004,048,0002,113,536
7May 18, 2026 02:0022,001660,051,274644,017,0004,059,0002,113,536
8May 18, 2026 02:0022,097662,933,057646,936,0004,197,0002,113,536
9May 18, 2026 02:0022,103663,090,212647,018,0004,079,0002,113,536