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 22, 2026 18:09olliecrowolliecrowScore: 5,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 18:105,734172,028,592433,483,0008,989,0002,363,392
2Apr 22, 2026 18:105,749172,498,286430,811,0009,972,0002,543,616
3Apr 22, 2026 18:105,858175,756,692430,443,00010,960,0002,686,976
4Apr 22, 2026 18:105,886176,584,277433,819,0009,017,0002,580,480
5Apr 22, 2026 18:105,908177,247,412443,409,0008,988,0002,760,704
6Apr 22, 2026 18:105,944178,338,933434,572,00010,963,0002,560,000
7Apr 22, 2026 18:106,035181,052,268439,940,00011,944,0002,580,480
8Apr 22, 2026 18:106,074182,230,787444,615,0008,972,0002,752,512
9Apr 22, 2026 18:106,410192,310,030441,083,0008,981,0002,568,192