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 listAug 17, 2026 04:50marko1597marko1597Score: 10,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:1010,016300,481,620280,154,00011,994,0002,121,728stderr
2Aug 17, 2026 05:1010,027300,821,038280,712,00011,864,0002,121,728stderr
3Aug 17, 2026 05:1010,031300,952,729280,704,00011,957,0002,121,728stderr
4Aug 17, 2026 05:1010,037301,132,859280,903,00011,892,0002,121,728stderr
5Aug 17, 2026 05:1010,039301,178,000280,759,00012,036,0002,121,728stderr
6Aug 17, 2026 05:1010,045301,358,119280,505,00011,746,0002,121,728stderr
7Aug 17, 2026 05:1010,126303,791,683283,805,00011,688,0002,121,728stderr
8Aug 17, 2026 05:1010,214306,435,917285,351,00011,812,0002,121,728stderr
9Aug 17, 2026 05:1010,297308,933,036288,809,00011,804,0002,121,728stderr