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:39TudyMTudyMScore: 11,316Success
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:4810,660319,810,809870,976,00018,999,0002,842,624
2Apr 27, 2026 22:4810,688320,645,676873,625,00014,010,0002,662,400
3Apr 27, 2026 22:4810,750322,519,413869,446,00018,987,0002,678,784
4Apr 27, 2026 22:4810,850325,528,692873,393,00017,007,0002,801,664
5Apr 27, 2026 22:4811,316339,496,772927,371,00015,989,0002,387,968
6Apr 27, 2026 22:4811,328339,841,193930,182,00015,985,0002,514,944
7Apr 27, 2026 22:4811,350340,521,774925,597,00018,011,0002,723,840
8Apr 27, 2026 22:4811,422342,670,718928,955,00015,982,0002,809,856
9Apr 27, 2026 22:4811,549346,485,950932,620,00011,995,0002,781,184