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 19:21olliecrowolliecrowScore: 13,147Success
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 19:2212,961388,838,579364,692,00010,019,0002,621,440
2Apr 28, 2026 19:2212,975389,272,571365,223,00011,006,0002,560,000
3Apr 28, 2026 19:2213,003390,117,549359,871,00010,996,0002,420,736
4Apr 28, 2026 19:2213,141394,249,572366,171,00010,032,0002,473,984
5Apr 28, 2026 19:2213,147394,436,677366,457,00011,043,0002,682,880
6Apr 28, 2026 19:2213,182395,460,220365,575,00010,987,0002,437,120
7Apr 28, 2026 19:2213,193395,814,025366,608,00011,018,0002,453,504
8Apr 28, 2026 19:2213,205396,160,603366,907,0009,022,0002,691,072
9Apr 28, 2026 19:2213,265397,953,056367,221,00011,036,0002,514,944