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 05:02olliecrowolliecrowScore: 5,692Success
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 05:035,600168,022,485413,679,0008,993,0002,551,808
2Apr 27, 2026 05:035,650169,508,596424,370,0008,986,0002,478,080
3Apr 27, 2026 05:035,657169,731,230423,706,0008,993,0002,584,576
4Apr 27, 2026 05:035,684170,541,339407,001,00010,000,0002,551,808
5Apr 27, 2026 05:035,692170,785,560419,397,0008,965,0002,576,384
6Apr 27, 2026 05:035,727171,825,758423,704,0008,951,0002,805,760
7Apr 27, 2026 05:035,743172,313,418423,526,0008,968,0002,355,200
8Apr 27, 2026 05:035,809174,272,983423,930,0008,998,0003,014,656
9Apr 27, 2026 05:035,810174,305,611421,884,00010,021,0002,748,416