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 listApr 24, 2026 03:17olliecrowolliecrowScore: 13,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 03:1912,988389,665,318365,502,00010,013,0002,527,232
2Apr 24, 2026 03:1913,007390,211,688364,279,00011,008,0002,490,368
3Apr 24, 2026 03:1913,071392,150,769366,428,00010,039,0002,424,832
4Apr 24, 2026 03:1913,073392,190,337366,993,00010,027,0002,420,736
5Apr 24, 2026 03:1913,121393,643,698364,038,00011,001,0002,654,208
6Apr 24, 2026 03:1913,122393,670,253366,124,0009,949,0002,719,744
7Apr 24, 2026 03:1913,139394,181,829365,233,00011,007,0002,596,864
8Apr 24, 2026 03:1913,206396,209,475366,989,0009,024,0002,433,024
9Apr 24, 2026 03:1913,240397,217,359364,741,00012,990,0002,433,024