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 listJun 26, 2026 15:21Shikhar SoniShikhar SoniScore: 48,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 15:2247,9051,437,176,7561,263,131,000163,867,0002,117,632
2Jun 26, 2026 15:2247,9431,438,307,3211,264,060,000163,822,0002,117,632
3Jun 26, 2026 15:2247,9811,439,435,7061,263,178,000166,086,0002,117,632
4Jun 26, 2026 15:2248,0441,441,349,4271,267,385,000163,531,0002,117,632
5Jun 26, 2026 15:2248,0451,441,355,1801,268,006,000163,117,0002,117,632
6Jun 26, 2026 15:2248,1011,443,050,5301,265,060,000167,319,0002,117,632
7Jun 26, 2026 15:2248,1111,443,348,3391,267,531,000165,056,0002,117,632
8Jun 26, 2026 15:2248,1231,443,706,8311,264,240,000169,300,0002,117,632
9Jun 26, 2026 15:2248,1521,444,560,0271,268,330,000165,835,0002,117,632