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 27, 2026 22:43TudyMTudyMScore: 14,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:5114,758442,741,4511,233,320,00039,010,0002,867,200
2Apr 27, 2026 22:5114,936448,109,9021,237,939,00035,969,0002,768,896
3Apr 27, 2026 22:5114,937448,126,0241,239,449,00033,984,0002,797,568
4Apr 27, 2026 22:5114,940448,203,7871,231,926,00038,997,0002,760,704
5Apr 27, 2026 22:5114,956448,693,4361,246,960,00025,978,0002,740,224
6Apr 27, 2026 22:5115,081452,446,8591,247,499,00029,987,0002,588,672
7Apr 27, 2026 22:5115,151454,546,0981,236,797,00038,993,0002,818,048
8Apr 27, 2026 22:5115,214456,428,9891,272,616,00037,899,0002,527,232
9Apr 27, 2026 22:5115,220456,620,3261,282,074,00026,959,0002,920,448