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 13, 2026 13:15Victor MerckléVictor MerckléScore: 3,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:173,19695,904,468245,501,0003,281,0002,699,264
2Jun 13, 2026 13:173,20896,268,724245,254,0003,268,0002,699,264
3Jun 13, 2026 13:173,21296,370,649244,134,0003,271,0002,699,264
4Jun 13, 2026 13:173,21296,366,110246,179,0003,294,0002,699,264
5Jun 13, 2026 13:173,22696,784,961243,601,0005,637,0002,695,168
6Jun 13, 2026 13:173,23296,961,781243,674,0003,155,0002,699,264
7Jun 13, 2026 13:173,25597,660,934249,807,0003,273,0002,699,264
8Jun 13, 2026 13:173,28098,427,959246,161,0003,290,0002,699,264
9Jun 13, 2026 13:173,473104,194,040252,449,0004,223,0002,695,168