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 listFeb 17, 2025 09:29Ian MckibbenIan MckibbenScore: 22,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2025 09:2922,086662,575,683561,574,00076,941,0002,535,424
2Feb 17, 2025 09:2922,130663,892,943549,012,00089,002,0002,785,280
3Feb 17, 2025 09:2922,207666,223,156553,228,00087,877,0002,523,136
4Feb 17, 2025 09:2922,227666,804,590544,684,00094,944,0002,760,704
5Feb 17, 2025 09:2922,264667,918,680574,071,00067,008,0002,584,576
6Feb 17, 2025 09:2922,317669,502,275566,767,00077,967,0002,531,328
7Feb 17, 2025 09:2922,342670,270,115557,577,00081,937,0002,641,920
8Feb 17, 2025 09:2922,370671,110,288552,886,00085,982,0002,535,424
9Feb 17, 2025 09:2922,432672,956,248565,120,00077,016,0002,531,328