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 17, 2026 20:18Charles CabergsCharles CabergsScore: 40,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 20:1840,2451,207,344,0053,154,336,000159,865,0002,650,112
2Apr 17, 2026 20:1840,3621,210,874,1893,138,672,000159,830,0002,609,152
3Apr 17, 2026 20:1840,4421,213,257,9313,157,350,000148,875,0002,547,712
4Apr 17, 2026 20:1840,4691,214,078,5183,171,825,000140,903,0002,789,376
5Apr 17, 2026 20:1840,5321,215,954,1233,160,265,000144,874,0002,506,752
6Apr 17, 2026 20:1840,6391,219,169,4743,156,898,000156,845,0002,854,912
7Apr 17, 2026 20:1840,8861,226,567,4293,180,541,000141,890,0002,801,664
8Apr 17, 2026 20:1840,9041,227,105,7153,169,826,000142,856,0002,531,328
9Apr 17, 2026 20:1840,9171,227,501,5563,157,056,000159,850,0002,740,224