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 06:46marko1597marko1597Score: 8,770Success
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 06:498,758262,755,787248,159,0006,250,0002,121,728stderr
2Aug 17, 2026 06:498,763262,911,893248,362,0006,276,0002,121,728stderr
3Aug 17, 2026 06:498,767263,034,848248,328,0006,263,0002,121,728stderr
4Aug 17, 2026 06:498,770263,121,223248,347,0006,459,0002,121,728stderr
5Aug 17, 2026 06:498,770263,101,083248,312,0006,493,0002,121,728stderr
6Aug 17, 2026 06:498,784263,546,923248,251,0006,190,0002,121,728stderr
7Aug 17, 2026 06:498,813264,406,914247,797,0006,228,0002,121,728stderr
8Aug 17, 2026 06:498,822264,665,798249,797,0006,452,0002,121,728stderr
9Aug 17, 2026 06:498,830264,906,743249,972,0006,423,0002,121,728stderr