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 28, 2026 22:12Victor MerckléVictor MerckléScore: 9,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 22:138,935268,077,457439,295,00059,768,0002,605,056
2Apr 28, 2026 22:138,979269,382,696436,651,00060,812,0002,809,856
3Apr 28, 2026 22:139,013270,392,131436,657,00065,647,0002,834,432
4Apr 28, 2026 22:139,045271,371,394437,265,00056,774,0002,666,496
5Apr 28, 2026 22:139,047271,411,887441,110,00059,014,0002,830,336
6Apr 28, 2026 22:139,099272,980,401437,640,00064,798,0002,834,432
7Apr 28, 2026 22:139,103273,090,759438,084,00065,563,0002,580,480
8Apr 28, 2026 22:139,121273,638,300436,551,00064,637,0002,641,920
9Apr 28, 2026 22:139,272278,189,932438,260,00063,747,0002,797,568