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 3, 2026 19:23TudyMTudyMScore: 68,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:2667,9572,038,716,6202,005,994,00012,676,0002,547,712
2May 3, 2026 19:2667,9972,039,935,8542,008,642,00011,573,0002,543,616
3May 3, 2026 19:2668,0402,041,229,3392,009,549,00012,681,0002,555,904
4May 3, 2026 19:2668,2592,047,787,4282,017,161,00012,689,0002,555,904
5May 3, 2026 19:2668,7122,061,373,9202,032,010,00012,848,0002,551,808
6May 3, 2026 19:2673,5132,205,417,4722,176,923,00012,962,0002,547,712
7May 3, 2026 19:2673,6562,209,698,3302,179,732,00012,968,0002,543,616
8May 3, 2026 19:2673,6752,210,262,7872,177,668,00012,915,0002,551,808
9May 3, 2026 19:2673,7562,212,703,4382,183,131,00013,060,0002,555,904