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 16, 2026 06:33M-RochatM-RochatScore: 100,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 06:34100,2703,008,117,0402,977,335,00019,118,0002,113,536
2May 16, 2026 06:34100,4103,012,311,7312,983,404,00019,620,0002,113,536
3May 16, 2026 06:34100,4173,012,538,1552,983,276,00018,679,0002,113,536
4May 16, 2026 06:34100,5963,017,893,8532,986,778,00019,030,0002,113,536
5May 16, 2026 06:34100,6493,019,482,6472,990,371,00019,360,0002,113,536
6May 16, 2026 06:34101,3203,039,610,1593,008,781,00019,346,0002,113,536
7May 16, 2026 06:34101,7103,051,309,7483,019,992,00019,899,0002,113,536
8May 16, 2026 06:34102,1533,064,603,2213,034,153,00020,007,0002,113,536
9May 16, 2026 06:34102,2733,068,217,4583,037,513,00019,513,0002,113,536