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:38TudyMTudyMScore: 46,931Success
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:4246,7111,401,332,6611,269,485,000116,882,0002,428,928
2May 3, 2026 19:4246,7221,401,662,2461,267,028,000118,419,0002,428,928
3May 3, 2026 19:4246,8231,404,713,8771,269,829,000117,755,0002,437,120
4May 3, 2026 19:4246,8801,406,417,7441,276,003,000114,088,0002,441,216
5May 3, 2026 19:4246,9311,407,957,2171,279,142,000113,068,0002,445,312
6May 3, 2026 19:4247,0001,410,024,5051,280,340,000113,275,0002,445,312
7May 3, 2026 19:4247,6791,430,393,6761,300,018,000115,323,0002,433,024
8May 3, 2026 19:4247,7741,433,223,1131,304,516,000112,458,0002,441,216
9May 3, 2026 19:4247,8351,435,050,6961,303,252,000115,161,0002,433,024