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 26, 2026 04:03olliecrowolliecrowScore: 6,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 04:055,973179,197,534453,049,0008,981,0002,543,616
2Apr 26, 2026 04:055,975179,269,121440,094,0009,979,0003,039,232
3Apr 26, 2026 04:055,997179,925,979440,863,0008,997,0002,400,256
4Apr 26, 2026 04:056,002180,089,025440,984,0008,999,0002,785,280
5Apr 26, 2026 04:056,014180,426,873441,138,00010,003,0002,519,040
6Apr 26, 2026 04:056,066182,009,969439,530,0009,989,0002,756,608
7Apr 26, 2026 04:056,076182,296,198440,724,0008,994,0002,760,704
8Apr 26, 2026 04:056,083182,516,352448,835,00011,942,0002,801,664
9Apr 26, 2026 04:056,268188,050,869439,796,00010,018,0002,756,608