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 listMar 13, 2026 15:08Dominique GarmierDominique GarmierScore: 116,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:08114,7363,442,087,6253,400,366,00013,993,0002,547,712
2Mar 13, 2026 15:08114,8243,444,720,3743,402,654,00013,990,0002,543,616
3Mar 13, 2026 15:08115,0423,451,267,0863,405,193,00011,993,0002,547,712
4Mar 13, 2026 15:08115,1473,454,414,2743,411,264,00012,993,0002,547,712
5Mar 13, 2026 15:08116,0203,480,596,5383,441,637,00012,991,0002,543,616
6Mar 13, 2026 15:08116,0373,481,105,2953,441,608,0008,993,0002,547,712
7Mar 13, 2026 15:08117,8863,536,591,7643,490,115,00015,991,0002,547,712
8Mar 13, 2026 15:08119,2463,577,375,7753,534,047,00013,992,0002,543,616
9Mar 13, 2026 15:08120,4393,613,175,7093,562,529,00018,986,0002,547,712