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 05:37olliecrowolliecrowScore: 13,074Success
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 05:3812,999389,977,229366,522,00011,015,0002,473,984
2Apr 27, 2026 05:3813,030390,925,402364,851,00011,962,0002,424,832
3Apr 27, 2026 05:3813,051391,553,856366,159,00010,004,0002,592,768
4Apr 27, 2026 05:3813,055391,657,529366,305,00010,035,0002,416,640
5Apr 27, 2026 05:3813,074392,240,540365,080,00011,969,0002,560,000
6Apr 27, 2026 05:3813,141394,259,451364,821,00011,024,0002,686,976
7Apr 27, 2026 05:3813,168395,060,540365,659,00010,989,0002,781,184
8Apr 27, 2026 05:3813,185395,570,003366,424,00011,012,0002,433,024
9Apr 27, 2026 05:3813,311399,341,988366,724,00011,021,0002,711,552