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 24, 2026 17:37olliecrowolliecrowScore: 6,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 17:385,839175,199,253439,536,0009,011,0002,682,880
2Apr 24, 2026 17:386,038181,169,413452,353,00011,008,0002,609,152
3Apr 24, 2026 17:386,095182,876,790451,917,0008,958,0002,662,400
4Apr 24, 2026 17:386,119183,573,342449,870,0008,997,0002,678,784
5Apr 24, 2026 17:386,171185,151,429448,777,00010,970,0002,449,408
6Apr 24, 2026 17:386,181185,444,925444,759,0009,994,0002,727,936
7Apr 24, 2026 17:386,198185,940,601449,575,00010,989,0002,334,720
8Apr 24, 2026 17:386,222186,688,090452,524,0008,951,0002,453,504
9Apr 24, 2026 17:386,313189,404,205454,216,00010,004,0002,453,504