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:59marko1597marko1597Score: 9,611Success
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:309,574287,244,870266,800,00011,967,0002,121,728stderr
2Aug 17, 2026 05:309,583287,516,422266,627,00011,789,0002,121,728stderr
3Aug 17, 2026 05:309,597287,919,176267,488,00011,950,0002,121,728stderr
4Aug 17, 2026 05:309,611288,358,974268,056,00011,884,0002,121,728stderr
5Aug 17, 2026 05:309,611288,355,617268,228,00011,735,0002,121,728stderr
6Aug 17, 2026 05:309,614288,440,543267,967,00012,079,0002,121,728stderr
7Aug 17, 2026 05:309,620288,607,325267,709,00011,878,0002,121,728stderr
8Aug 17, 2026 05:309,762292,861,530272,213,00011,883,0002,121,728stderr
9Aug 17, 2026 05:309,801294,034,680273,794,00011,809,0002,121,728stderr