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 17, 2026 00:12M-RochatM-RochatScore: 22,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:1421,965658,950,292645,222,0004,082,0002,113,536
2May 17, 2026 00:1421,990659,719,370646,729,0004,030,0002,113,536
3May 17, 2026 00:1421,991659,737,007645,219,0004,058,0002,113,536
4May 17, 2026 00:1421,997659,914,850645,873,0004,046,0002,113,536
5May 17, 2026 00:1422,059661,776,810648,870,0004,011,0002,113,536
6May 17, 2026 00:1422,071662,131,323648,942,0004,230,0002,113,536
7May 17, 2026 00:1422,122663,674,511648,790,0004,056,0002,113,536
8May 17, 2026 00:1422,202666,068,577650,620,0004,420,0002,113,536
9May 17, 2026 00:1422,557676,714,688662,566,0004,167,0002,113,536